Previous studies on wireless sensor networks indicate one of the most important research topics is to consider both significance of the reduction in sensor nodes energy consumption and improving network lifetime. Rega...
详细信息
Previous studies on wireless sensor networks indicate one of the most important research topics is to consider both significance of the reduction in sensor nodes energy consumption and improving network lifetime. Regarding results of some researchers using sinks, mobility has a substantial impact on the performance of sensor networks concerning reducing total energy consumption, increasing the number of active nodes and solving the energy-hole problem. In this study, we consider hexagons beehives feature where sensor nodes are distributed across a hexagon randomly. This hexagonal is divided into equal clusters based on the radius of hexagonal. Also, the need for cluster heads to be close to their centre of clusters in the previous similar model is solved by adding mobility to the sinks, providing a pre-determined path for mobile sinks and covering each cluster by sinks from two different directions. Therefore, the proposed model simulation results show the increase in the average of residual energy between sensor nodes, reducing total energy consumption, increasing the number of active nodes and ultimately improving the lifetime of wireless sensor networks related to previous models.
This paper describes our performance evaluation results of BATMAN-adv wireless mesh network routing algorithms, particularly its new variant, version V. The BATMAN protocol has developed continuously after its initial...
详细信息
ISBN:
(纸本)9781538658505
This paper describes our performance evaluation results of BATMAN-adv wireless mesh network routing algorithms, particularly its new variant, version V. The BATMAN protocol has developed continuously after its initial release and now several variants are available, especially the transmission quality based BATMAN-adv version IV and the throughput based version V. The version IV has deployed and tested in many publications. However, the version V has not been verified in literature. We here design several test cases to compare the performance between version IV and V and the results are presented. It shows that the version V does not outperform the version IV in terms of delay, pack loss and throughput. It is suggested that the adjustable parameters of the version V should be studied carefully in the future.
Wireless sensor networks are a new technology of information acquisition and processing, so they are widely used in all kinds of fields. In the paper we introduce Agent technology into the wireless sensor network, con...
详细信息
ISBN:
(纸本)9780819495662
Wireless sensor networks are a new technology of information acquisition and processing, so they are widely used in all kinds of fields. In the paper we introduce Agent technology into the wireless sensor network, conduct a in-depth research on the four routing schemes, and propose a new improved routing scheme, which considers the energy consumption of both nodes and path. Furthermore, The scheme we proposed has efficient routing function, can balance the energy consumption of nodes and extends the lifetime of the network in a more efficient way.
In this paper, we present a novel routing algorithm in order to avoid deadlock and packet dropping. In our proposed algorithm the network-on-chip (NoC) is capable of tolerating faults in presence of control faults in ...
详细信息
ISBN:
(纸本)9781479905621;9781479905638
In this paper, we present a novel routing algorithm in order to avoid deadlock and packet dropping. In our proposed algorithm the network-on-chip (NoC) is capable of tolerating faults in presence of control faults in combinational parts of routers. In addition, by modifying the functionality of the router, the router is enabled to test its own, as well as the preceding router's functionality based on the routing algorithm, destination address and previous router's situation. Each router recognizes the faulty neighbor and announces it to successive routers. In this scheme no extra packets will be generated. We analyze the effects of our method on latency, power consumption and drop rate. Our experimental results illustrate that, fault coverage for routers can reach up to 100% with yet low power consumption and significant improvement in latency compared to the baseline approach.
WirelessHART, a kind of wireless mesh communication network that suits process automation, are widely used in the industrial fields. routing algorithm performance directly determines sensor nodes how to transfer and c...
详细信息
ISBN:
(纸本)9783037857519
WirelessHART, a kind of wireless mesh communication network that suits process automation, are widely used in the industrial fields. routing algorithm performance directly determines sensor nodes how to transfer and control data, and the effective data rate. The algorithm which affects the energy consumption and lifetime of the whole sensor network is the core content of the network layer. WirelessHART network layer routing algorithm includes Source Route and Graph Route. In this paper, WirelessHART routing algorithm is simulated using nesC language in the TinyOS, and then compares with AODV protocol. And the data of experiment show the application advantage of Wireless HART Graph Route.
Software-defined Internet of Vehicles (SDIoV) has emerged as a promising field of study as it could overcome the shortcomings of traditional vehicular networks, such as offering efficient data transmission and traffic...
详细信息
Software-defined Internet of Vehicles (SDIoV) has emerged as a promising field of study as it could overcome the shortcomings of traditional vehicular networks, such as offering efficient data transmission and traffic shaping in different vehicular scenarios to satisfy all the requirements of applications on the fly. Although routing solutions are lightly addressed for SDIoV, there are many limitations of routing protocols unaddressed in such environment. More precisely, shortest path routing algorithms are mostly focused in the state of the arts. This paper presents quality of service aware routing algorithm that forwards packets toward the most reliable and connected path to the destination. Particularly, candidate routes should satisfy metrics, such as signal to interference and noise ratio (SINR) constraint and have the highest probability of connectivity. To address these issues, we have formulated a discrete optimization problem to favor the best route among candidate paths and proposed the modified laying chicken algorithm (LCA) that results better results than the traditional approaches. We have mathematically analyzed the probability of connectivity along with the SINR metric. Moreover, a multiscore function based on traffic density and greediness factor is proposed to make intelligent decision at the intersections. Simulation results are used to validate the superiority of the proposed routing approach over the existing solutions.
In mobile Ad Hoc networks (MANETs), flooding-based route discovery is usually preferred in order to set up the route with reliability between transmission pair. However, this approach may cause a serious contention in...
详细信息
In mobile Ad Hoc networks (MANETs), flooding-based route discovery is usually preferred in order to set up the route with reliability between transmission pair. However, this approach may cause a serious contention in transmission between adjacent nodes and a considerable amount of control packets. In addition, most of Ad Hoc routing protocols establish the route with minimum hop count. Consequently, the performance of Ad Hoc routing protocol is considerably affected by link (or route) duration since the network comprises the nodes with unrestricted mobility and constrained range in transmission. This paper proposes novel routing protocol that aims to (1) minimize routing overhead in route discovery procedure, and (2) guarantee a reliable and fast packet delivery between source and destination, especially in providing real-time applications over MANETs. To achieve this objective, we introduce relay region (RR) within the transmission range of nodes in order to select optimal next relaying nodes for supporting specific application requirements in route discovery procedure. The RR is defined by the limited distance progress in transmission to next relaying node in order to maintain the established route for an arbitrary length of time (i.e., route duration) while meeting packet delivery reliability and delay constraints. In performance evaluation, the simulation results showed that the proposed scheme can significantly improve the performance in comparison with the previous routing algorithms in terms of packet delivery ratio and packet delivery latency, reducing transmission redundancy in route discovery procedure.
This paper presents an improved routing algorithm based on the social link awareness. In this algorithm, multiple social features of the nodes' behaviors are utilized to quantify the nodes pairs' social links....
详细信息
ISBN:
(纸本)9781467363372
This paper presents an improved routing algorithm based on the social link awareness. In this algorithm, multiple social features of the nodes' behaviors are utilized to quantify the nodes pairs' social links. The social links of the nodes pairs are computed based on their encounter history. These social links can be used to construct the friendship communities of the nodes. The intra-community and inter-community forwarding mechanisms are implemented to raise the successful delivery ratio with low overhead and decrease the transmission delay. Simulation results show that the proposed algorithm shortens the routing delay and the overhead, and increases the successful delivery ratio, thereby improving the routing efficiency.
Elevator-first routing algorithm has been introduced for partially connected 3D network-on-chip as a low-cost, distributed and deadlock-free routing algorithm using two virtual channels. This paper proposes Redelf, a ...
详细信息
ISBN:
(纸本)9781467364911;9781467364928
Elevator-first routing algorithm has been introduced for partially connected 3D network-on-chip as a low-cost, distributed and deadlock-free routing algorithm using two virtual channels. This paper proposes Redelf, a modification of the elevator-first routing algorithm on a 3D mesh topology. The proposed algorithm requires no virtual channel to ensure deadlock-freedom.
Roadmap is important in typical robotic applications and it is not a trivial task to obtain in unknown space. In this paper, we propose a novel approach to calculate the roadmap that is robust against noisy environmen...
详细信息
Roadmap is important in typical robotic applications and it is not a trivial task to obtain in unknown space. In this paper, we propose a novel approach to calculate the roadmap that is robust against noisy environmental contours and the movement of the robot. In order to obtain full visibility to space, we design a direct space partitioning approach to produce the roadmap. It uses readings from rangefinders to establish sequential polygons in time, and as the robot moves, intersections among polygons are iteratively obtained. After iterations of updates, we obtain a number of polygons with stable forms. Based on the connections among the polygons, we obtain a roadmap and propose a routing algorithm to calculate paths between points in space. Simulation examples are provided to demonstrate the performance of the proposed approach.
暂无评论