As one of the new self-organizing and self-configuration broadband networks, wireless mesh networks are being increasingly attractive. In order to solve the load balancing problem in wireless mesh networks, this paper...
详细信息
As one of the new self-organizing and self-configuration broadband networks, wireless mesh networks are being increasingly attractive. In order to solve the load balancing problem in wireless mesh networks, this paper proposes a novel multi-path routing algorithm based on clustering (Cluster_MMesh) for wireless mesh networks. In the clustering stage, on the basis of the maximum connectivity clustering algorithm and k-hop clustering algorithm, according to the idea of maximum connectivity, a new concept of node connectivity degree is proposed in this paper, which can make the selection of cluster head more simple and reasonable. While clustering, the node which has less expected load in the candidate border gateway node set will be selected as the border gateway node. In the multi-pathrouting establishment stage, we use the intra-clustering multi-path routing algorithm and inter-clustering multi-path routing algorithm to establish multi-pathrouting from the source node to the destination node. At last, in the traffic allocation stage, we will use the virtual disjoint multi-path model (Vdmp) to allocate the network traffic. Simulation results show that the Cluster_MMesh routingalgorithm can help increase the packet delivery rate, reduce the average end to end delay, and improve the network performance.
Data gathering in an energy efficient way, is one of the crucial concerns in Wireless Sensor Networks (WSNs). With incorporation of Compressive Sensing (CS), as a data aggregation scheme the information contained in t...
详细信息
Data gathering in an energy efficient way, is one of the crucial concerns in Wireless Sensor Networks (WSNs). With incorporation of Compressive Sensing (CS), as a data aggregation scheme the information contained in the signal, is safely maintained through its projections, which can be reconstructed later. Inclusion of CS, for an energy efficient routing technique further enhances the lifetime of the network. To improve network lifetime, CS has been employed at level 1 (at the leaf nodes). The dimensionality reduction at the transmitter is done, using a measurement matrix. At the receiver, data is recovered using greedy based methods. Greedy based method offers low complexity, and low implementation cost. The success rate of greedy method, depends on the sparsity of the data. Performance evaluation of greedy based method is analyzed, by considering varying sparsity and plotted against number of measurements, required to reconstruct the signal. At the same time, reconstruction error of every method has been evaluated by varying sparsity of the signal. The same is analyzed by considering real temperature, and humidity data sets.
To reduce route coupling and improve reliabilitics of transmitting paths in wireless mobile ad hoc networks, a parallel multi-path routing algorithm called LT-PMPRA is proposed in the paper. It takes the living time b...
详细信息
ISBN:
(纸本)9783642274510
To reduce route coupling and improve reliabilitics of transmitting paths in wireless mobile ad hoc networks, a parallel multi-path routing algorithm called LT-PMPRA is proposed in the paper. It takes the living time based on power factors of nodes and links as the routing parameters to solve the problems of mobility and limited power of nodes, and uses two iterative factors in the multi-path selecting processes based on a modified Dijkstra' algorithm to find different node-disjointed or link-disjointed paths, by which to enhance the transmitting efficiency of parallel paths. The main data models and key algorithm of LT-PMPRA are given in the paper in detail, and two types of simulation experiments are done to verify the validities of the algorithm. It is showed that LT-PMPRA can improve obviously the stabilities and disjointedness of paths.
Recent standardization activities bring high Quality of Service (QoS) and predictability to Internet of Things (IoT), which are "going industrial". Critical applications such as industrial process control, s...
详细信息
ISBN:
(纸本)9781467389990
Recent standardization activities bring high Quality of Service (QoS) and predictability to Internet of Things (IoT), which are "going industrial". Critical applications such as industrial process control, smart grid or vehicle automation require deterministic transmissions with properties such as on-time data deliveries and end-to-end reliability close to 100%. Traditional radio technologies based on collision detection and retransmission introduce unpredictable delays, and can not ensure reliable delivery within a narrowly bounded time. This paper proposes to exploit spatial diversity and packet redundancy to compensate for the inherently lossy wireless medium. We introduce "Leapfrog Collaboration", a communication mechanism which takes advantage of communication overhearing, and in which parallel transmissions over two paths are scheduled. Promiscuous listening between the paths enables nodes to possibly overhear transmissions on the other. We evaluate the delay and jitter of the communication by simulation using Contiki OS and show that Leapfrog Collaboration outperforms the default retransmission-based approach of IEEE802.15.4-TSCH by up to 28% and 54%, respectively, while providing high network reliability.
Critical applications such as industrial process control, smart grid and vehicle automation require networks which offer on-time data delivery and wire-like end-to-end reliability. This paper proposes to exploit path ...
详细信息
ISBN:
(纸本)9780994988614
Critical applications such as industrial process control, smart grid and vehicle automation require networks which offer on-time data delivery and wire-like end-to-end reliability. This paper proposes to exploit path diversity to compensate for the lossy nature of the wireless medium. We introduce “Leapfrog Collaboration”, a communication mechanism in which multiple copies of the same packet traverse the network on disjoint paths. Emulation results on Cooja show that, compared to single-path transmission, this technique reduces end-to-end delay by up to 28%, and jitter by up to 58%.
Applications such as the smart grid or vehicle automation require deterministic transmissions with properties such as on-time data deliveries and end-to-end reliability close to 100%. We introduce a novel mechanism ba...
详细信息
ISBN:
(纸本)9780994988614
Applications such as the smart grid or vehicle automation require deterministic transmissions with properties such as on-time data deliveries and end-to-end reliability close to 100%. We introduce a novel mechanism based on BIERTE, a scheme in which parallel transmissions over several paths are scheduled, while promiscuous listening between the paths enables nodes to possibly overhear transmissions on the other. We propose an implementation of this new approach for the dependability competition.
The Available routing Construct (ARC), recently proposed at IETF, provides a promising model for achieving highly reliable routing in large-scale networks. Among its features, ARC offers multi-pathrouting by design. ...
详细信息
ISBN:
(纸本)9781479930807
The Available routing Construct (ARC), recently proposed at IETF, provides a promising model for achieving highly reliable routing in large-scale networks. Among its features, ARC offers multi-pathrouting by design. In the present work, we introduce ARC for the first time to the research community. Then, we show, by means of simulation results, how ARC over-performs classical multi-path routing algorithms, by building disjoint multiple paths without extra-cost due to new route computation.
暂无评论