To find the optimal routing is always an important topic in wireless sensor networks (WSNs). Considering a WSN where the nodes have limited energy, we propose a novel Energy*Delay model based on ant algorithms ("...To find the optimal routing is always an important topic in wireless sensor networks (WSNs). Considering a WSN where the nodes have limited energy, we propose a novel Energy*Delay model based on ant algorithms ("E&D ANTS" for short) to minimize the time delay in transferring a fixed number of data packets in an energy-constrained manner in one round. Our goal is not only to maximize the lifetime of the network but also to provide real-time data transmission services. However, because of the tradeoff of energy and delay in wireless network systems, the reinforcement learning (RL) algorithm is introduced to train the model. In this survey, the paradigm of E&D ANTS is explicated and compared to other ant-based routing algorithms like AntNet and AntChain about the issues of routing information, routing overhead and adaptation. Simulation results show that our method performs about seven times better than AntNet and also outperforms AntChain by more than 150% in terms of energy cost and delay per round.展开更多
With the advancements in wireless sensor networks, Internet of Vehicles(IOV) has shown great potential in aiding to ease traffic congestion. In IOV, vehicles can easily exchange information with other vehicles and inf...With the advancements in wireless sensor networks, Internet of Vehicles(IOV) has shown great potential in aiding to ease traffic congestion. In IOV, vehicles can easily exchange information with other vehicles and infrastructures, thus, the development of IOV will greatly improve vehicles safety, promote green information consumption and have a profound impact on many industries. The purpose of this paper is to promote the innovation and development of IOV. Firstly, this paper presents general requirements of IOV such as guidelines, basic principles, and the goal of development. Secondly, we analyze critical applications, crucial support, and business model to promote the industrial development of IOV. Finally, this paper proposes some safeguard measures to further promote the development of IOV.展开更多
The highly mobility of vehicles, intermittent communication between the vehicles and the requirements of real time applications are some of the main challenges of multi-hop message delivery in Vehicular Ad Hoc Networ...The highly mobility of vehicles, intermittent communication between the vehicles and the requirements of real time applications are some of the main challenges of multi-hop message delivery in Vehicular Ad Hoc Networks （ VANETs ）. There are also additional challenges, especially when the destination for the message delivery is a moving vehicle. In this paper, we propose a novel multihop message delivery method, called the Coverage Area-based oPportunistic message forwarding algorithm （CAP）. The main idea of CAP is to cover the potential area of a moving target vehicle as much as possible with the reachable area of the required delivery messages, so that the message can be delivered successfully. Because the success ratio and overhead of the multi-hop message delivery are two important but incompatible parameters in CAP, two tunings are discussed in the algorithm in order to maintain the balance of the two parameters. The simulation results show that compared with other reference approaches, CAP provides an efficient message delivery with a higher success ratio and a shorter message deNNy.展开更多
基金Project (No. 30470461) supported in part by the National NaturalScience Foundation of China
文摘To find the optimal routing is always an important topic in wireless sensor networks (WSNs). Considering a WSN where the nodes have limited energy, we propose a novel Energy*Delay model based on ant algorithms ("E&D ANTS" for short) to minimize the time delay in transferring a fixed number of data packets in an energy-constrained manner in one round. Our goal is not only to maximize the lifetime of the network but also to provide real-time data transmission services. However, because of the tradeoff of energy and delay in wireless network systems, the reinforcement learning (RL) algorithm is introduced to train the model. In this survey, the paradigm of E&D ANTS is explicated and compared to other ant-based routing algorithms like AntNet and AntChain about the issues of routing information, routing overhead and adaptation. Simulation results show that our method performs about seven times better than AntNet and also outperforms AntChain by more than 150% in terms of energy cost and delay per round.
文摘With the advancements in wireless sensor networks, Internet of Vehicles(IOV) has shown great potential in aiding to ease traffic congestion. In IOV, vehicles can easily exchange information with other vehicles and infrastructures, thus, the development of IOV will greatly improve vehicles safety, promote green information consumption and have a profound impact on many industries. The purpose of this paper is to promote the innovation and development of IOV. Firstly, this paper presents general requirements of IOV such as guidelines, basic principles, and the goal of development. Secondly, we analyze critical applications, crucial support, and business model to promote the industrial development of IOV. Finally, this paper proposes some safeguard measures to further promote the development of IOV.
基金The research was supported partially by the Major State Basic Research Development Program (973 Program) of China under Grant No.2009CB320504，the National High-tech Research and Development Program (863 Program) of China under Grant No.2011AA01A101，the National Natural Science Foundation of China under Grant No.61271041
文摘The highly mobility of vehicles, intermittent communication between the vehicles and the requirements of real time applications are some of the main challenges of multi-hop message delivery in Vehicular Ad Hoc Networks （ VANETs ）. There are also additional challenges, especially when the destination for the message delivery is a moving vehicle. In this paper, we propose a novel multihop message delivery method, called the Coverage Area-based oPportunistic message forwarding algorithm （CAP）. The main idea of CAP is to cover the potential area of a moving target vehicle as much as possible with the reachable area of the required delivery messages, so that the message can be delivered successfully. Because the success ratio and overhead of the multi-hop message delivery are two important but incompatible parameters in CAP, two tunings are discussed in the algorithm in order to maintain the balance of the two parameters. The simulation results show that compared with other reference approaches, CAP provides an efficient message delivery with a higher success ratio and a shorter message deNNy.
