Performance evaluation of shortest multipath source routing scheme

Multipath routing in mobile ad-hoc networks allows the establishment of multiple paths for routing between a source-destination pair. It exploits the resource redundancy and diversity in the underlying network to provide benefits such as fault tolerance, load balancing, bandwidth aggregation and the improvement in quality-of-service metrics such as delay. Previous work shows that on-demand multipath routing schemes achieve better performance under certain scenarios with respect to a number of key performance metrics when compared with traditional single-path routing mechanisms. A multipath routing scheme, referred to as shortest multipath source (SMS) routing based on dynamic source routing (DSR) is proposed here. The mechanism has two novel aspects compared with other on-demand multipath routing schemes: it achieves shorter multiple partial-disjoint paths and allows more rapid recovery from route breaks. The performance differentials are investigated using NS-2 under conditions of varying mobility, offered load and network size. Results reveal that SMS provides a better solution than existing source-based approaches in a truly mobile ad-hoc environment.     

自组网中一种基于跨层负载感知的蚁群优化路由协议

将蚁群优化和跨层优化方法结合起来,提出了一种基于跨层负载感知和蚁群优化的路由协议(CLAOR)。协议将整个路径中各节点MAC层的总平均估计时延和节点队列缓存的占用情况结合起来,共同作为路由选择和路由调整的重要度量标准进行按需路由发现和维护,通过拥塞节点丢弃蚂蚁分组以及借助部分兼具蚂蚁功能的数据分组实现正常路由表的维护等方法,减少了控制开销,增加了算法的可扩展性,较好地解决了自组网中现有基于蚁群优化的路由协议中普遍存在的拥塞问题、捷径问题和引入的路由开销问题。仿真结果表明,CLAOR在分组成功递交率、路由开销以及端到端平均时延等方面具有优良性能,能很好地实现网络中的业务流负载均衡。     

Compatibility of TCP Reno and TCP Vegas in wireless ad hoc networks

Previous work has shown that TCP (transmission control protocol) Vegas outperforms the more widely deployed TCP Reno in both wired and wireless networks. It was also shown that when both TCP variants coexist on the same wired links, Reno dominates because of its more aggressive behaviour. This paper examines for the first time the compatibility between Reno and Vegas in wireless IEEE 802.11 ad hoc networks. It is shown that Vegas generally dominates in the heterogeneous Reno/Vegas network scenario; a startling result that is inconsistent with what is seen in wired networks. It is shown that the wireless ad hoc network environment does not reward the aggressive behaviour of Reno. On the other hand, Vegas, with its more accurate yet more conservative mechanisms, is able to capture most of the bandwidth. This is found to be true when using the on-demand routing protocols of dynamic source routing (DSR) or ad hoc on-demand distance vector (AODV): the failure of a node to reach a next-hop node because of media access control (MAC)-sublayer repeated collisions is reported to the routing protocol, which then declares a route error that impacts Reno in a more serious way than Vegas. When the table-driven routing protocol destination-sequenced distance vector (DSDV) is used, Reno and Vegas share the network bandwidth in a fairer manner. Generally, fairness in this environment can be improved by reducing the TCP maximum window size.     

Link stability and mobility in ad hoc wireless networks

The fact that ad hoc networks are required to support mobility of individual network nodes results in problems arising when routing data. These problems include route loss, poor longevity of established routes and asymmetric communications links. Mobility of nodes also increases the control traffic overhead and affects the performance of the protocol. Mobility can, however, be exploited to improve route longevity when establishing the route. In some situations, the source of information is not available (e.g. GPS information in the underground), hence protocols relying on this information will fail to operate correctly. In such situations, alternative `self-content' information should be available to perform the needed task of routing. Three novel schemes that make use of such information, the heading direction angle, to provide a mechanism for establishing and maintaining robust and long-lived routes are presented. The results show that these schemes reduce the overhead and increase the route longevity when compared with the AODV protocol. The schemes described can operate as a standalone mechanism or can be adopted by other routing protocols in order to improve their performance.     

On physical layer-oriented routing with power control in ad hoc wireless networks

Routing in ad hoc wireless networks does not simply consist in finding a route with shortest length (as in wired networks with virtually error-free communication links), but it requires the creation of a stable and good quality communication route to avoid any unnecessary packet loss. In this paper,we discuss physical layer-oriented routing in ad hoc wireless networks, and we analyse the potential advantages of combining the use of power control (PC) with the chosen routing strategy. More precisely, we propose a modified ad hoc on-demand distance vector (MAODV) routing protocol, with and without PC, derived from the AODV-routing protocol by considering the bit error rate at the end of a multi-hop path as the metric to be minimised for route selection. In other words, we consider routing with a physical layer-oriented quality of service criterion, and we analyse the system performance in scenarios with either strong line-of-sight (LOS) or shadowed communications. Although in a scenario with strong LOS communications there are a few cases where the MAODV-PC protocol offers the best performance, in the presence of shadowed communications the proposed physical layer-oriented strategy is not attractive.     

An Energy Based Dynamic AODV Routing Protocol in Wireless Ad Hoc Networks

In recent years, with the rapid development of the Internet and wireless communication technology, wireless Ad hoc networks have received more attention. Due to the limited transmission range and energy of nodes in Ad hoc networks, it is important to establish a reliable and energy-balanced transmission path in Ad hoc networks. This paper proposes an energy-based dynamic routing protocol based on the existing AODV routing protocol, which has the following two aspects of improvement: (1) In the route discovery process, a node selects a suitable route from the minimum energy consumption route and the energy-balanced route designed in this paper according to a “Mark” bit that representing remaining energy of a node. (2) Based on (1), a route interruption update strategy was proposed to restart the route discovery process when node energy was used excessively. Simulation results demonstrate that compared with AODV and other existing routing protocols, proposed algorithm can reduce network energy consumption and balance node energy, thus extending the network lifetime.     

Multilayer flavoured dynamic source routing in mobile ad-hoc networks

Dynamic source routing (DSR, introduced in 1996) is one of the most frequently used routing protocols for mobile ad-hoc networks (MANETs). Numerous MANET protocols were created based on DSR's algorithm. In addition to inheriting the overall performance specifications of DSR, these MANET protocols are designed to perform optimised for specific functionality. To name a few, these functionalities include: hierarchical routing, security-aware routing and multipath routing. Such flavoured DSR schemes (X-DSR) are often compared against the original DSR protocol through simulation results. The purpose of this survey is to first introduce DSR in detail, discuss most of the DSR flavours, point out their specific features, and to present a complete survey of the analyses given in the current literature against the original DSR protocol. Following this in-depth discussion, we introduce an X-DSR-aware management architecture, which utilises a multilayer scheme that imports parameters from different layers (network, data-link and physical) and performs current network condition matching compared to the closest pre-defined network condition groups. The output of such a match is the selection of the most optimal routing protocol, which satisfies most of the criteria of the predefined condition group.     

一种改进的传感器网络分簇分层路由协议

在分析了无线传感器网络中传统的LEACH和LEACH-C路由协议基础上,结合MTE路由协议思想,提出了一种新的改进型分簇分层路由协议(improved clustering hierarchical routing protocol,ICH).文中簇首节点可以采用多跳方式传输数据包,且在选择中继节点时考虑节点剩余能量,对进入下一轮的条件进行了限制.实验表明,改进后的ICH协议的节点存活率比LEACH-C好.     

Energy-efficient directional routing between partitioned actors in wireless sensor and actor networks

Actor?actor communication is an important part of the functioning of wireless sensor?actor networks and enables the actor nodes to take coordinated action on a given event. Owing to various reasons such as actor mobility and low actor density, the actor network tends to get partitioned. The authors propose to use the underlying sensor nodes, which are more densely deployed, to heal these partitions. In order to maximise the utilisation of the limited energy available with the sensor nodes, a new routing protocol for actor?actor communication using directional antennas on the actor nodes is proposed. The authors contribution is threefold. First, using simulations they show that the problem of partitioning in the actor networks is significant and propose an architecture with directional antennas on actor nodes and sensor bridges to heal these partitions. Second, they identify the routing problem for this architecture based on a theoretical framework and propose centralised as well as distributed solutions to it. Third, they develop a routing protocol based on the distributed solution and show, using network simulations, that the proposed protocol not only heals the network partitions successfully, but also achieves high throughput and fairness across different flows, in addition to maximising the network lifetime.     

Reliable cross-layer multicast with local backtracking for improving transmission control protocol performance in ad hoc networks

The conventional layered protocols in ad hoc networks tend to suffer from the inability to distinguish between losses due to route failures and congestion because of the inflexible structure. Recently, in efforts to overcome the challenges of dynamic environment, there have been increased interests in protocols that rely on interactions between different layers. The authors propose a cross-layer multicasting scheme based on the concept of local backtracking groups and adequate buffer equipped within nodes to avoid undesired retransmission from the source and further to improve the efficiency of source-to-receivers delivery with the aid of buffer. While encountering route failure, a node can quickly restore its routing paths to multicast subscribers by exploiting the precise notification from the MAC layer and the parent group then opportunely provides it with an unacknowledged packets conserved in the buffer. It is obviously benefic that retransmission packets are issued from the parent group rather than from the source. The authors present both analytic models and simulation results that substantiate the efficiency and robust of our approach based on realistic mobility scenarios.     

Sea trials of an underwater, ad hoc, acoustic network with stationary assets

The diverse roles of deployable underwater assets have increased the need for ad hoc networking capability. This capability is defined as the ability to form acoustic communication links by deploying assets in a non-deterministic manner, without depending on a priori route and positioning information. Each asset represents a node in the network, and can act as a data source, sink or router, and initiates, stores or relays data, respectively. Data packets may be hopped over a few nodes before arriving at the designated destination. This ad hoc network consists of two main layers: the medium access control (MAC) layer to resolve node contention, and the ad hoc routing layer to manage routing information. In the MAC layer, both random access and timedivision protocols are applied. The protocol in the routing layer is responsible for route setup and route maintenance. This concept of multiple-hop, ad hoc networking was implemented during sea trials conducted in Portland Harbour, UK, involving up to six nodes. The trial was designed with the aim of gaining application experience in ad hoc network deployment and in assessing the performance of the protocols in a real operating environment. The emphasis was on modem integration, and the stability and reliability of packet transport. The trial results and their subsequent analysis demonstrated the robustness of the network in performing ad hoc routing and resolving node contention in a realistic and acoustically challenging environment.     

Source selection routing algorithms in integrated cellular networks

Integrated cellular networks (ICNs) are normally constructed by adding ad hoc overlay on cellular networks to solve the latter's flexibility and capacity expansion problems. In such networks, routing plays a critical role in finding a route to divert congested traffic from a congested cell to another less crowded cell. Much work has been conducted on routing protocols in ICNs, whereas no dedicated work has been found for an important aspect of routing, namely source selection. The process of a source selection can be an algorithm that is designed for selecting a proper pseudo- source to release its occupying channel to a blocked mobile user. Consequently, this pseudo-source diverts its ongoing call to another cell by using a free channel in a neighbour cell via a relaying route. Based on an introduction of a representative ICN infrastructure, three source selection algorithms are proposed. Both numerical analysis and evaluation results are presented, which show the efficiency of the algorithms and their different abilities in adapting to different network situations, such as traffic density and cell capacity.     

ECO-BAT: A New Routing Protocol for Energy Consumption Optimization Based on BAT Algorithm in WSN

Wireless sensor network (WSN) has been widely used due to its vast range of applications. The energy problem is one of the important problems influencing the complete application. Sensor nodes use very small batteries as a power source and replacing them is not an easy task. With this restriction, the sensor nodes must conserve their energy and extend the network lifetime as long as possible. Also, these limits motivate much of the research to suggest solutions in all layers of the protocol stack to save energy. So, energy management efficiency becomes a key requirement in WSN design. The efficiency of these networks is highly dependent on routing protocols directly affecting the network lifetime. Clustering is one of the most popular techniques preferred in routing operations. In this work we propose a novel energy-efficient protocol for WSN based on a bat algorithm called ECO-BAT (Energy Consumption Optimization with BAT algorithm for WSN) to prolong the network lifetime. We use an objective function that generates an optimal number of sensor clusters with cluster heads (CH) to minimize energy consumption. The performance of the proposed approach is compared with Low-Energy Adaptive Clustering Hierarchy (LEACH) and Energy Efficient cluster formation in wireless sensor networks based on the Multi-Objective Bat algorithm (EEMOB) protocols. The results obtained are interesting in terms of energy-saving and prolongation of the network lifetime.     

LOA-RPL: Novel Energy-Efficient Routing Protocol for the Internet of Things Using Lion Optimization Algorithm to Maximize Network Lifetime

Energy conservation is a significant task in the Internet of Things (IoT) because IoT involves highly resource-constrained devices. Clustering is an effective technique for saving energy by reducing duplicate data. In a clustering protocol, the selection of a cluster head (CH) plays a key role in prolonging the lifetime of a network. However, most cluster-based protocols, including routing protocols for low-power and lossy networks (RPLs), have used fuzzy logic and probabilistic approaches to select the CH node. Consequently, early battery depletion is produced near the sink. To overcome this issue, a lion optimization algorithm (LOA) for selecting CH in RPL is proposed in this study. LOA-RPL comprises three processes: cluster formation, CH selection, and route establishment. A cluster is formed using the Euclidean distance. CH selection is performed using LOA. Route establishment is implemented using residual energy information. An extensive simulation is conducted in the network simulator ns-3 on various parameters, such as network lifetime, power consumption, packet delivery ratio (PDR), and throughput. The performance of LOA-RPL is also compared with those of RPL, fuzzy rule-based energy-efficient clustering and immune-inspired routing (FEEC-IIR), and the routing scheme for IoT that uses shuffled frog-leaping optimization algorithm (RISA-RPL). The performance evaluation metrics used in this study are network lifetime, power consumption, PDR, and throughput. The proposed LOA-RPL increases network lifetime by 20% and PDR by 5%–10% compared with RPL, FEEC-IIR, and RISA-RPL. LOA-RPL is also highly energy-efficient compared with other similar routing protocols.     

Lifetime improvement in wireless sensor networks via collaborative beamforming and cooperative transmission

Collaborative beamforming (CB) and cooperative transmission (CT) have recently emerged as communication techniques that can make effective use of collaborative/cooperative nodes to create a virtual multiple-input/multiple-output system. Extending the lifetime of networks composed of battery-operated nodes is a key issue in the design and operation of wireless sensor networks. The effects on network lifetime of allowing closely located nodes to use CB/CT to reduce the load or even to avoid packet-forwarding requests to nodes that have critical battery life are considered. First, the effectiveness of CB/CT in improving the signal strength at a faraway destination using energy in nearby nodes is studied. Then, the performance improvement obtained by this technique is analysed for a special 2D disc case. Further, for general networks in which information-generation rates are fixed, a new routing problem is formulated as a linear- programming problem, whereas for other general networks, the cost for routing is dynamically adjusted according to the amount of energy remaining and the effectiveness of CB/CT. From the analysis and the simulation results, it is seen that the proposed method can reduce the payloads of energy-depleting nodes by about 90% in the special case network considered and improve the lifetimes of general networks by about 10%, compared with existing techniques.     

Prophet_TD Routing Algorithm Based on Historical Throughput and Encounter Duration

Opportunistic networks are self-organizing networks that do not require a complete path between the source node and the destination node as it uses encounter opportunities brought by nodes movement to achieve network communication. Opportunistic networks routing algorithms are numerous and can be roughly divided into four categories based on different forwarding strategies. The Prophet routing algorithm is an important routing algorithm in opportunistic networks. It forwards messages based on the encounter probability between nodes, and has good innovation significance and optimization potential. However, the Prophet routing algorithm does not consider the impact of the historical throughput of the node on message transmission, nor does it consider the impact of the encounter duration between nodes on message transmission. Therefore, to improve the transmission efficiency of opportunistic networks, this paper based on the Prophet routing algorithm, fuses the impact of the historical throughput of the node and the encounter duration between nodes on message transmission at the same time, and proposes the Prophet_TD routing algorithm based on the historical throughput and the encounter duration. This paper uses the Opportunistic Networks Environment v1.6.0 (the ONE v1.6.0) as the simulation platform, controls the change of running time and the number of nodes respectively, conducts simulation experiments on the Prophet_TD routing algorithm. The simulation results show that compared to the traditional Prophet routing algorithm, on the whole, the Prophet_TD routing algorithm has a higher message delivery rate and a lower network overhead rate, and its average latency is also lower when node density is large.     

A Fault-Handling Method for the Hamiltonian Cycle in the Hypercube Topology

Many routing protocols, such as distance vector and link-state protocols are used for finding the best paths in a network. To find the path between the source and destination nodes where every node is visited once with no repeats, Hamiltonian and Hypercube routing protocols are often used. Nonetheless, these algorithms are not designed to solve the problem of a node failure, where one or more nodes become faulty. This paper proposes an efficient modified Fault-free Hamiltonian Cycle based on the Hypercube Topology (FHCHT) to perform a connection between nodes when one or more nodes become faulty. FHCHT can be applied in a different environment to transmit data with a high-reliability connection by finding an alternative path between the source and destination nodes when some nodes fail. Moreover, a proposed Hamiltonian Near Cycle (HNC) scheme has been developed and implemented. HNC implementation results indicated that FHCHT produces alternative cycles relatively similar to a Hamiltonian Cycle for the Hypercube, complete, and random graphs. The implementation of the proposed algorithm in a Hypercube achieved a 31% and 76% reduction in cost compared to the complete and random graphs, respectively.     

Medium access control layer management for saving energy in wireless sensor networks routing algorithms

Wireless sensor networks (WSNs) consist of small nodes that are capable of sensing, computing, and communication. One of the greatest challenges in WSNs is the limitation of energy resources in nodes. This limitation applies to all of the protocols and algorithms that are used in these networks. Routing protocols in these networks should be designed considering this limitation. Many papers have been published examining low energy consumption networks. One of the techniques that has been used in this context is cross-layering. In this technique, to reduce the energy consumption, layers are not independent but they are related to each other and exchange information with each other. In this paper, a cross-layer design is presented to reduce the energy consumption in WSNs. In this design, the communication between the network layer and medium access layer has been established to help the control of efforts to access the line to reduce the number of failed attempts. In order to evaluate our proposed design, we used the NS2 software for simulation. Then, we compared our method with a cross-layer design based on an Ad-hoc On-demand Distance Vector routing algorithm. Simulation results show that our proposed idea reduces energy consumption and it also improves the packet delivery ratio and decreases the end-to-end delay in WSNs.     

一种新型水下移动自组织网路由算法

目前针对移动自组织网提出的路由协议普遍存在路由发现和路由维护效率低的问题,在研究按需距离矢量(AODV)路由算法的基础上,提出了一种水下多路径选择按需距离向量算法(MAODV)。该算法采用多节点路由切换机制,在一条链路失效后不必重新启动路由发现过程,而选用备用节点构成新的链路,继续进行数据包的传输,大大节省了信息资源和带宽。计算机统计仿真表明,该MAODV方法的性能在端到端通信的平均时间延迟和数据包接收率上均优于(AODV)。有效地解决了路由协议中路由发现和路由维护效率低的问题。