No abstract

No abstract

Wireless sensor networks (WSNs) are ad hoc topologies with highly dynamic traffic rates offered. In this network, sensor nodes are often battery operated and the power consumption become more important issue. The medium access control (MAC) protocol designed for the network must be stable and consume less energy. The available non-persistent carrier sense multiple access (np-CSMA) based MAC protocol is not suitable for WSN because of higher possibility of frame collisions and consume more energy at variable traffic rates. To overcome this limitation, the carrier sense multiple access protocol with collision avoidance (CSMA/CA) called nanoMAC is used. The nanoMAC is more suitable for WSN to achieve high data and energy efficiency. In this paper Game theory based nanoMAC (G-nanoMAC) protocol and the performance is evaluated for the energy consumption and delay to maximize the lifetime of the multihop network. Simulation results shows that using game based nanoMAC protocol in WSN for multihop forwarding is more energy efficient

<p>In wireless sensor networks (WSNs), secret shared keys must be established with the neighboring nodes in order to achieve secure communication. The challenge issues for secured communication in WSN are the Key management. Location Dependent Key (LDK) management is a suitable scheme when compared to other location based key management schemes because of lesser memory space requirement and lesser number of keys to be stored on each sensor node. However, the LDK is affected by communication interference problem which is solved by the key is distributed based on trust model. The distributed key updates and revocation processes are effectively resist inside attackers. An energy-efficient Key Management with Trust Model (KM-TM) for WSNs is proposed to achieve the secured communication and the nodes are resisting from the attackers. The performances of proposed KM-TM for WSNs are evaluated in terms of trustworthiness of sensor nodes and security breaches more effectively.  </p>

No abstract