Browsing by Author "Singh, Parmod"

Now showing 1 - 4 of 4

Energy efficient broadcast protocols for asynchronous duty-cycled wireless sensor networks
(1970-01-01)
Singh, Parmod
;
Chen, Yaw-Chung
;
資訊工程學系
;
Department of Computer Science
In asynchronous duty-cycled wireless sensor networks (WSNs), each node has its own sleep schedule that is independent of the schedules of neighboring nodes. Since each node follows its own independent sleep schedule, the probability that a node's neighbors will wake up concurrently is quite low. For this reason, each single hop broadcast must be completed through multiple unicast transmissions, and the sender node must remain awake until all of its neighboring nodes have received the broadcast packet. In this paper, we present two energy efficient broadcast protocols, namely Broadcast Progress-based Efficient Multihop Broadcast (BPEMB) protocol and Tree-based Efficient Multihop Broadcast (TEMB) protocol, for asynchronous duty-cycled WSNs. In both of the proposed protocols, the decision of whether to transmit the broadcast packet is based on the link quality information and without any forwarder's guidance list. The redundant transmissions and collisions are avoided effectively with cooperation among the neighbors, so that the node with the best link quality to the receiver node takes responsibility to forward the packet to the receiver node. With this approach, nodes that are not involved in transmitting the broadcast packet can go to sleep and save their energy. In the BPEMB protocol, the forwarding decision of transmitting the broadcast packet is also influenced by the broadcast progress information, which is piggybacked in the broadcast packet. Through extensive simulations, we demonstrate that the proposed protocols can significantly improve the broadcast efficiency through reducing the energy consumption and minimizing the broadcast latency. The evaluation results also show that both the BPEMB and TEMB protocols can substantially reduce the collisions and redundant transmissions in asynchronous duty-cycled WSNs.
Energy Efficient Greedy Forwarding based on Residual Energy for Wireless Sensor Networks
(2018-01-01)
Singh, Parmod
;
Chen, Yaw Chung
;
資訊工程學系
;
Department of Computer Science
In this paper, we present an Energy Efficient Greedy Forwarding (EEGF) routing protocol for wireless sensor networks. EEGF guarantees the deliverability of data from sensors to the base station and improves the network lifetime. Most of the existing routing protocols for wireless sensor networks that try to increase the network lifetime compromise on the deliverability of data packets. EEGF routing protocol has taken both the issues of successful packet delivery to the sink and maximizing the network lifetime into consideration. It is categorized under the class of location based routing protocols as node requires information of its own geographical location and its one hop neighbor's location along with the destination's geographical location. Simulation results have demonstrated that our proposed routing protocol is effective in increasing the network lifetime with guaranteed packet delivery to destination as long as network remains connected.
RPL Enhancement for a Parent Selection Mechanism and an Efficient Objective Function
(2019-11-01)
Singh, Parmod
;
Chen, Yaw-Chung
;
資訊工程學系
;
Department of Computer Science
In routing protocol (RPL), a child node exclusively makes the decision in selecting a parent based on the Rank value. In this paper, we make the parent selection mechanism, a mutual decision between the potential parent node and the child node, which significantly improves the network throughput under a heavy and highly dynamic load. To demonstrate the effectiveness of our parent selection mechanism, we used it to balance the load to avoid congestion by preventing the child node from using the congested parent node. The proposed parent selection mechanism is implemented as an add-on feature in RPL and hence is called enhanced RPL (EN-RPL). Furthermore, we introduce a new objective function for efficient routing (OF-ER) that is based on the newly defined composite efficient routing (CER) metric. CER metric takes important metrics, namely, the link quality, queue utilization, lifetime of node, delay, and number of bottleneck nodes, into account for optimal parent selection. The simulation results demonstrate that EN-RPL lowers the packet loss by up to 37 & x0025; and reduces energy consumption by up to 46.5 & x0025; compared with the standard RPL. The evaluation results of OF-ER outperform the state-of-the-art load balancing-based OF with respect to the network stability, reliability, and energy efficiency.
Sensing coverage hole identification and coverage hole healing methods for wireless sensor networks
(2020-04-01)
Singh, Parmod
;
Chen, Yaw-Chung
;
資訊工程學系
;
Department of Computer Science
Wireless sensor networks are often deployed for event detection and environmental monitoring. However, their success in providing quality of service can only be ensured if the network does not have any sensing coverage holes. The existence of sensing coverage holes is unavoidable due to various factors such as environmental disasters, random deployment and hardware failure of the sensor nodes. Therefore, detecting the sensing coverage holes is essential for the successful operation of the network. We present a chord-based hole detection method for identifying the sensing coverage holes; this method is effective in identifying both closed and open holes in the region of interest. Since it is also necessary to heal the sensing coverage holes to improve the quality of service of the sensor network, we also propose a sensing coverage hole healing method, namely, the chord-based hole covering (CBHC) method. The CBHC method provides complete sensing coverage of the network using the minimum number of sensor nodes by minimizing the sensing coverage area overlap. Additionally, our proposed method for sensing coverage hole identification can also identify the boundary of the sensor network. The simulation results demonstrate the satisfactory performances of both the proposed hole identification and hole healing methods in identifying the sensing coverage holes and efficiently covering the sensing coverage holes, respectively.