TY  - JOUR
AV  - none
JF  - Eurasip Journal on Wireless Communications and Networking
PB  - Springer International Publishing
VL  - 2017
KW  - Access control; Ad hoc networks; Adaptive control systems; Energy efficiency; Energy resources; Energy utilization; Medium access control; Network performance; Next generation networks; Power management (telecommunication); Scheduling algorithms; Sensor nodes; Sleep research; Synchronization
KW  -  Dnyamic; Fundamental design; Idle listening; Medium access control protocols; Neighbour nodes; Neighbouring nodes; Slot reservation; Wireless sensor network (WSNs)
KW  -  Wireless sensor networks
IS  - 1
TI  - Adaptive Sleep Efficient Hybrid Medium Access Control algorithm for next-generation wireless sensor networks
Y1  - 2017///
SN  - 16871472
N2  - The scheduling algorithm is a fundamental design problem to allocate resources amongst different entities in distributive wireless sensor networks (WSNs). These sensor nodes have limited power and non-replenishable energy resources. In WSNs, the duty cycling mechanism is commonly used to save energy due to idle listening. On the other hand, a fixed duty cycling mechanism increases transmission latency in WSNs. Therefore, in order to ensure the prolonged network-life of WSNs, the medium access control (MAC) protocol should be tackled in an efficient manner to improve energy efficiency by minimizing idle listening, maximizing sleep duration, and eliminating data collision. This paper proposes a practical Adaptive Sleep Efficient Hybrid Medium Access Control (AEH-MAC) algorithm in which the key idea is to dynamically adjust nodesâ?? sleep time to improve the scheduling in WSNs. The AEH-MAC allows nodes to adjust sleep time dynamically according to the traffic load and coordinate wakeup time with neighbour nodes. A series of short taken packets are transmitted to wake the receiver, and a prediction field is introduced in the ACK packets (GRANT/RELEASE) to reduce the waiting time of the source node. In the proposed algorithm, each node maps a conflict-free time slot for itself up to two-hop neighbouring nodes. The simulation results show that the AEH-MAC algorithm achieves high performance in terms of runtime, number of rounds, energy consumption, and slot reservation. © 2017, The Author(s).
ID  - scholars8112
N1  - cited By 8
UR  - https://www.scopus.com/inward/record.uri?eid=2-s2.0-85019063704&doi=10.1186%2fs13638-017-0870-y&partnerID=40&md5=afe1c96deb611b718d0b14e1a2f78921
A1  - Bakhsh, S.T.
A1  - AlGhamdi, R.
A1  - Altalhi, A.H.
A1  - Tahir, S.
A1  - Sheikh, M.A.
ER  -