By considering the benefits of using Wireless Sensor Network in Disaster Management, an appropriate structure for Wireless Sensor Network based on clustered and hierarchical models will be proposed. By applying differ...
详细信息
ISBN:
(纸本)9780769549637;9781467356534
By considering the benefits of using Wireless Sensor Network in Disaster Management, an appropriate structure for Wireless Sensor Network based on clustered and hierarchical models will be proposed. By applying different policies in each layer of proposed structure, energy consumption will be decreased. Furthermore, by studying the characteristics of the Wireless Sensor Network for Disaster Management, a new proper routing algorithm for using in the proposed Wireless Sensor Network will be presented. The proposed algorithm is based on some wildly used routing algorithm that adapted for the proposed structure for disaster management. By applying the proposed routing algorithm in the proposed structure energy consumption will be decreased and the time limitation for real-time data will be guaranteed. Increasing data transfer reliability is another benefit of proposed structure.
We have put forward a RFID routing algorithm based on virtual coordinates, on the basis of the differences and similarities between the RFID route and the WSN route. In order to solve the RFID routing problem under th...
详细信息
ISBN:
(纸本)9783037858646
We have put forward a RFID routing algorithm based on virtual coordinates, on the basis of the differences and similarities between the RFID route and the WSN route. In order to solve the RFID routing problem under the environment of mobile node, this method has specified physical environment with virtual coordinates, and has found the optimal path between the source node and destination node by using scanning calculation. In the eclipse environment, the results of the experiment show that this method is more efficient and has less communication overhead.
Today, a wide variety of applications with different requirements are rapidly developed in industrial wireless sensor networks, and providing the Quality of Service (QoS) for this kind of communication network is inev...
详细信息
Today, a wide variety of applications with different requirements are rapidly developed in industrial wireless sensor networks, and providing the Quality of Service (QoS) for this kind of communication network is inevitable. It is difficult to solve the problems of poor adaptability and difficulty in the implementation of the QoS-based network configuration and management in traditional network architecture. We present a hierarchical software-defined network architecture for wireless sensor networks, which makes the complex network management possible and the system more adaptable. Furthermore, we propose a QoS-based routing protocol, called QSDN-WISE, which consists of a clustering algorithm, a routing algorithm, and local network maintenance. A double-cluster head-based uneven clustering algorithm, called DCHUC, avoids the energy hole phenomenon and reduces the workload of a single cluster head. The centralized QSDN-WISE routing algorithm constructs two heterogeneous forwarding paths for nodes, which meets the requirements for different data levels. Local network maintenance reduces the number of control messages in the network. The simulation results indicate that the QSDN-WISE can provide the QoS support for data with different requirements, balance the network energy consumption, and prolong the network's lifetime.
Adaptive algorithms are able to intelligently adjust their behavior in light of the changing situation to achieve the best promising results. The adaptive routing algorithms have been employed in multi-chip interconne...
详细信息
ISBN:
(纸本)9781479932511
Adaptive algorithms are able to intelligently adjust their behavior in light of the changing situation to achieve the best promising results. The adaptive routing algorithms have been employed in multi-chip interconnection networks in order to get better network performance. In this paper we propose a new Globally Self-adaptive and Scalable routing algorithm for Network-on-Chip (NoC) architectures namely (GSASRA). Our algorithm makes global routing decisions using particle swarm optimization technique to find global congestion information and to efficiently and intelligently decide the path to route the packet in each direction from source to the destination nodes. We implemented our proposed approach using SystemC and compared our approach with the SystemC based Fully-Adaptive and XY routing algorithms under matrix-transpose traffic pattern. Results from our experiment and simulations show that, our approach proves to be efficient in terms of throughput, latency and energy consumption for self-adaptive and scalable network-on-chip architectures.
Intensive Aquaculture Wireless Sensor Network (WSN) for water quality monitoring has specific requirements such as limited energy availability, low memory. Ant Colony Optimization (ACO) routing algorithm can maximize ...
详细信息
ISBN:
(纸本)9783037855959
Intensive Aquaculture Wireless Sensor Network (WSN) for water quality monitoring has specific requirements such as limited energy availability, low memory. Ant Colony Optimization (ACO) routing algorithm can maximize the lifetime of the network. A modified routing algorithm for Intensive Aquaculture WSN based on the ACO meta-heuristic is presented in this paper. Functions of basic ACO-based algorithm are modified to update the pheromone trail. The performance of Intensive Aquaculture WSN is improved on reducing memory used in monitor nodes and energy spent with communications. The modified routing algorithm was simulated for Intensive Aquaculture WSN scenarios and the results show that it maximizes energy savings.
Clustering and multi-hop routing algorithms prolongs the lifetime of wireless sensor networks(WSNS) substantially. However, existing algorithms usually consider clustering and routing as two independent problems. Info...
详细信息
ISBN:
(纸本)9780769550220
Clustering and multi-hop routing algorithms prolongs the lifetime of wireless sensor networks(WSNS) substantially. However, existing algorithms usually consider clustering and routing as two independent problems. Information exchanged in clustering phase is not fully utilized in routing phase. Energy Hole is another problem that shrinks the lifetime of WSNs due to the characteristics of the multi-hop forwarding model. In this paper, we propose a Context-Aware Unequal-Clustering routing algorithm (CAUCR) for WSNs, which consists of an Optimized Weighted Unequal-Clustering algorithm (OWUCA) and a Reverse Minimum Energy (RME) multi-hop routing algorithm. During our OWUCA clustering process, we additionally save some useful information for the subsequent RME routing algorithm, including minimum energy, minimum hop to base, and residual energy of neighbor cluster heads. RME starts routing construction based on the cluster head's distance to the sink, and the cluster head closer to the sink forms the routing table earlier. At the same time, RME utilizes the saved clustering information to reduce the overhead and energy consumption of the routing phase. Simulation results show that our CAUCR balances the energy consumption among sensor nodes, relieves the influence of "energy hole", and achieves an obvious improvement on the network lifetime.
Short contact time period between nodes as well as limited node buffers usually exist in opportunistic networks, resulting in the increase of delay and the loss of data packets. To address the problem, an improved epi...
详细信息
ISBN:
(纸本)9780769551227
Short contact time period between nodes as well as limited node buffers usually exist in opportunistic networks, resulting in the increase of delay and the loss of data packets. To address the problem, an improved epidemic routing algorithm(Reliable and Efficient routing algorithm assisted with Buffer Management, REBM) is proposed. Firstly, through the exchange of SV (Summary Vector) control packets, the data packets already reached the destination nodes are removed from the node buffers. Moreover, the data packets destined to the one-hop neighboring nodes obtain the priority to transmit. Theoretical analysis and extensive simulation results showed that the proposed algorithm can effectively increase the delivery rate, shorten the delivery delay, decrease the total number of transmitted data packets and cut down the buffer occupancy without increasing any control overhead.
Wireless Sensor Networks consists of a huge number of small self-contained devices with computational, sensing and wireless communication capabilities. LEACH is a classical clustering-based protocol in wireless sensor...
详细信息
ISBN:
(纸本)9783642316555;9783642316562
Wireless Sensor Networks consists of a huge number of small self-contained devices with computational, sensing and wireless communication capabilities. LEACH is a classical clustering-based protocol in wireless sensor network. In this paper, we propose an improved routing algorithm LEACH-WQ based on the analysis of LEACH protocol, which involves cluster head choosing, multi-hop routing and the building of its path. As a result the number of cluster head is constant and near optimal per round. Simulation results prove that the routing algorithm proposed by us has higher energy utilizing rate, and it helps prolonging the network lifetime.
Opportunistic network as a representative network evolved from social networks and ad hoc networks, has been on cutting edges in recent years. Due to its inherent characteristics serving for intermittent networking se...
详细信息
ISBN:
(纸本)9781467360852;9781467360845
Opportunistic network as a representative network evolved from social networks and ad hoc networks, has been on cutting edges in recent years. Due to its inherent characteristics serving for intermittent networking setting specifically, the opportunistic network has been also widely applied in the domain of Internet of Things (IoT). Many researchers have focused on the realistic mobility model and cost-effective routing scheme. Community as one of the most inherent attributes of the opportunistic network has been proved to be much helpful in simulating mobility traces of human society and selecting suitable message forwarders. This paper proposes a community-structured mobility model with consideration of geographical location preference and time-variance in human behavior patterns. Based on this model, a novel routing algorithm is presented by jointly considering utilities generated by social degree and relation. The results show that our routing scheme is able to improve success rate while control the routing cost and transmission delay into a reasonable range.
A routing algorithm is proposed to increase link reliability in smart metering over low-tension power line grid. The algorithm assumes data concentrator (DC) is polling meters connected to the power line to send energ...
详细信息
ISBN:
(纸本)9781467352857;9781467352840
A routing algorithm is proposed to increase link reliability in smart metering over low-tension power line grid. The algorithm assumes data concentrator (DC) is polling meters connected to the power line to send energy consumption, loading profile and any other crucial data to the utility. The proposed algorithm is designed to keep the needed complexity at the meters at minimum, while moving the intelligence up to the DC. The protocol accounts for asymmetric characteristics of the power line channel, where some nodes couldn't receive data from DC and neighbor nodes (deaf nodes), while its transmission could be received properly. Special packet structure is proposed to minimize algorithm overhead. Performance comparison with AODV protocol in terms of average throughput, reachability, and protocol overhead is in progress.
暂无评论