Engineering the Virtual Node Layer for Reactive MANET Routing

The VNLayer approach simplifies software development for MANET by providing the developers an abstraction of a network divided into fixed geographical regions, each containing a virtual server for network services. In this paper, we present our study on reactive MANET routing over the VNLayer. During this research, we identified in our initial VNLayer implementation three major limitations that lead to heavy control traffic, long forwarding paths and frequent message collisions in MANET routing. To address the problems, we changed the assumptions made by the VNLayer on the link layer and extended the operations allowed by VNLayer. This results in a VNLayer implementation that can be tuned to optimize the performance of traffic intensive applications (such as routing) while maintaining their simplicity and robustness. Simulation results showed that VNAODV, a VNLayer based routing protocol adapted from AODV, delivers more packets, generates less routing traffic and creates more stable routes than AODV in a dense MANET with high node motion rates. This research validated that the VNLayer approach makes software development for MANET easier and improves the performance of MANET protocols

Routing Protocols for Large-Scale Wireless Sensor Networks: A Review

With the advances in micro-electronics, wireless sensor gadgets have been made substantially littler and more coordinated, and large-scale wireless sensor networks (WSNs) based the participation among the noteworthy measure of nodes have turned into a hotly debated issue. "Large-scale" implies for the most part large region or high thickness of a system. As needs be the routing protocols must scale well to the system scope augmentation and node thickness increments. A sensor node is regularly energy-constrained and can't be energized, and in this manner its energy utilization has a very critical impact on the adaptability of the protocol. To the best of our insight, at present the standard strategies to tackle the energy issue in large-scale WSNs are the various leveled routing protocols. In a progressive routing protocol, every one of the nodes are separated into a few gatherings with various task levels. The nodes inside the abnormal state are in charge of data aggregation and administration work, and the low level nodes for detecting their environment and gathering data. The progressive routing protocols are ended up being more energy-proficient than level ones in which every one of the nodes assume a similar part, particularly as far as the data aggregation and the flooding of the control bundles. With concentrate on the various leveled structure, in this paper we give an understanding into routing protocols planned particularly for large-scale WSNs. As per the distinctive goals, the protocols are by and large ordered in light of various criteria, for example, control overhead decrease, energy utilization mitigation and energy adjust. Keeping in mind the end goal to pick up a thorough comprehension of every protocol, we feature their imaginative thoughts, portray the basic standards in detail and break down their points of interest and hindrances. Also a correlation of each routing protocol is led to exhibit the contrasts between the protocols as far as message unpredictability, memory necessities, localization, data aggregation, bunching way and different measurements. At last some open issues in routing protocol plan in large-scale wireless sensor networks and conclusions are proposed

Routing Protocols for Large-Scale Wireless Sensor Networks: A Review

With the advances in micro-electronics, wireless sensor gadgets have been made substantially littler and more coordinated, and large-scale wireless sensor networks (WSNs) based the participation among the noteworthy measure of nodes have turned into a hotly debated issue. "Large-scale" implies for the most part large region or high thickness of a system. As needs be the routing protocols must scale well to the system scope augmentation and node thickness increments. A sensor node is regularly energy-constrained and can't be energized, and in this manner its energy utilization has a very critical impact on the adaptability of the protocol. To the best of our insight, at present the standard strategies to tackle the energy issue in large-scale WSNs are the various leveled routing protocols. In a progressive routing protocol, every one of the nodes are separated into a few gatherings with various task levels. The nodes inside the abnormal state are in charge of data aggregation and administration work, and the low level nodes for detecting their environment and gathering data. The progressive routing protocols are ended up being more energy-proficient than level ones in which every one of the nodes assume a similar part, particularly as far as the data aggregation and the flooding of the control bundles. With concentrate on the various leveled structure, in this paper we give an understanding into routing protocols planned particularly for large-scale WSNs. As per the distinctive goals, the protocols are by and large ordered in light of various criteria, for example, control overhead decrease, energy utilization mitigation and energy adjust. Keeping in mind the end goal to pick up a thorough comprehension of every protocol, we feature their imaginative thoughts, portray the basic standards in detail and break down their points of interest and hindrances. Also a correlation of each routing protocol is led to exhibit the contrasts between the protocols as far as message unpredictability, memory necessities, localization, data aggregation, bunching way and different measurements. At last some open issues in routing protocol plan in large-scale wireless sensor networks and conclusions are proposed

A Survey on Routing Protocols for Large-Scale Wireless Sensor Networks

With the advances in micro-electronics, wireless sensor devices have been made much smaller and more integrated, and large-scale wireless sensor networks (WSNs) based the cooperation among the significant amount of nodes have become a hot topic. “Large-scale” means mainly large area or high density of a network. Accordingly the routing protocols must scale well to the network scope extension and node density increases. A sensor node is normally energy-limited and cannot be recharged, and thus its energy consumption has a quite significant effect on the scalability of the protocol. To the best of our knowledge, currently the mainstream methods to solve the energy problem in large-scale WSNs are the hierarchical routing protocols. In a hierarchical routing protocol, all the nodes are divided into several groups with different assignment levels. The nodes within the high level are responsible for data aggregation and management work, and the low level nodes for sensing their surroundings and collecting information. The hierarchical routing protocols are proved to be more energy-efficient than flat ones in which all the nodes play the same role, especially in terms of the data aggregation and the flooding of the control packets. With focus on the hierarchical structure, in this paper we provide an insight into routing protocols designed specifically for large-scale WSNs. According to the different objectives, the protocols are generally classified based on different criteria such as control overhead reduction, energy consumption mitigation and energy balance. In order to gain a comprehensive understanding of each protocol, we highlight their innovative ideas, describe the underlying principles in detail and analyze their advantages and disadvantages. Moreover a comparison of each routing protocol is conducted to demonstrate the differences between the protocols in terms of message complexity, memory requirements, localization, data aggregation, clustering manner and other metrics. Finally some open issues in routing protocol design in large-scale wireless sensor networks and conclusions are proposed