Decision fusion for composite hypothesis testing in wireless sensor networks over a shared and noisy collision channel

Avoiding from congestion and provision of reliable communication characterising the low energy consumption and high data rate is one of the momentous challenges at Media Access Control (MAC) layer. This become more difficult to achieve when there is energy constraint mixed with mobility of nodes. Same issue is addressed in this underlying paper. Here we have proposed a Time-Sharing Energy Efficient Congestion Control (TSEEC) technique for Mobile Wireless Sensor Networks. Time Division Multiple Access Protocol (TDMA) and Statistical Time Division Multiple Access Protocol (STDMA) are major constituents of this technique. These helps in conserving the energy by controlling the sleeping, waking up and listening states of sensor nodes. Load Based Allocation and Time Allocation Leister techniques further helps in conserving the network energy minimizing the network congestion. First mentioned technique is designed on the basis of STDMA Protocol and uses the sensor node information to dynamically assign the time slots while later said technique is does the job of mobility management of sensor node. This Time Allocation Leister techniques further comprises of Extricated Time Allocation (ETA), Shift Back Time Allocation (SBTA), and eScaped Time Allocation (STA) sub techniques for managing the joing and leaving of nodes to cluster and redundant\absence of data for communication respectively. To control the movement of mobile sensor nodes, we have also introduced mobility pattern as part of TSEEC that helps in making the protocol adaptive to traffic environment and to mobility as well. A comparitive analysis of proposed mechanism with SMAC is performed in NS2 along with mathematical anslysis by considering energy consumption, and packet deliver ratio as performance evaluation parameters. The results for the former outperforms to that of later. Moreover, comparative analysis of the proposed TSEEC with other MAC protocols is also presented.

Download Full-text

Energy Efficient Congestion Control in Wireless Sensor Networks

Sensor Technology ◽

10.4018/978-1-7998-2454-1.ch037 ◽

2020 ◽

pp. 780-799

Author(s):

Awais Ahmad ◽

Anand Paul ◽

Sohail Jabbar ◽

Seungmin Rho

Keyword(s):

Wireless Sensor Networks ◽

Energy Consumption ◽

Time Allocation ◽

Sensor Node ◽

Time Division Multiple Access ◽

Sensor Nodes ◽

Wireless Sensor ◽

Access Protocol ◽

Time Division ◽

Multiple Access Protocol

Avoiding from congestion and provision of reliable communication characterising the low energy consumption and high data rate is one of the momentous challenges at Media Access Control (MAC) layer. This become more difficult to achieve when there is energy constraint mixed with mobility of nodes. Same issue is addressed in this underlying paper. Here we have proposed a Time-Sharing Energy Efficient Congestion Control (TSEEC) technique for Mobile Wireless Sensor Networks. Time Division Multiple Access Protocol (TDMA) and Statistical Time Division Multiple Access Protocol (STDMA) are major constituents of this technique. These helps in conserving the energy by controlling the sleeping, waking up and listening states of sensor nodes. Load Based Allocation and Time Allocation Leister techniques further helps in conserving the network energy minimizing the network congestion. First mentioned technique is designed on the basis of STDMA Protocol and uses the sensor node information to dynamically assign the time slots while later said technique is does the job of mobility management of sensor node. This Time Allocation Leister techniques further comprises of Extricated Time Allocation (ETA), Shift Back Time Allocation (SBTA), and eScaped Time Allocation (STA) sub techniques for managing the joing and leaving of nodes to cluster and redundant\absence of data for communication respectively. To control the movement of mobile sensor nodes, we have also introduced mobility pattern as part of TSEEC that helps in making the protocol adaptive to traffic environment and to mobility as well. A comparitive analysis of proposed mechanism with SMAC is performed in NS2 along with mathematical anslysis by considering energy consumption, and packet deliver ratio as performance evaluation parameters. The results for the former outperforms to that of later. Moreover, comparative analysis of the proposed TSEEC with other MAC protocols is also presented.

Download Full-text

Collision-aware distributed detection with population-splitting algorithms

EURASIP Journal on Wireless Communications and Networking ◽

10.1186/s13638-020-01890-3 ◽

2021 ◽

Vol 2021 (1) ◽

Author(s):

Seksan Laitrakun

Keyword(s):

Single Channel ◽

Random Access ◽

Transmission Probability ◽

Distributed Detection ◽

Sensor Nodes ◽

Final Decision ◽

Slotted Aloha ◽

Splitting Algorithm ◽

Access Protocol ◽

Random Access Protocol

AbstractWe consider the design of distributed detection algorithms for single-hop, single-channel wireless sensor networks in which sensor nodes send their local decisions to a fusion center (FC) by using a random access protocol. There is also limited time to collect local decisions before a final decision must be made. We thus propose and analyze a modified random access protocol in which the FC combines slotted ALOHA with a population-splitting algorithm called population-splitting-based random access (PSRA) and collision-aware distributed detection according to an estimate-then-fuse approach. Under the PSRA, only sensor nodes whose observations fall in a particular range of reliability will send their decisions in a specific frame by using slotted ALOHA. At the end of the collection time, the FC applies the collision-aware distributed detection to make a final decision. Here, the FC will first observe the state of each time slot—idle, successful, collision—in each frame, use this information to estimate the number of sensor nodes participating in each frame, and, then, compute a final decision using a population-based fusion rule. An approximation of the optimal transmission probability of the slotted ALOHA is determined to minimize the probability of error. Numerical results show that, unlike slotted-ALOHA-based data networks, the transmission probability maximizing the number of successful time slots does not optimize the performance of the proposed distributed detection. Instead, the proposed distributed detection performs best with a transmission probability that induces many collisions.

Download Full-text