Novel Energy Aware Algorithm to Design Multilayer Architecture for Dense Wireless Sensor Networks

Network layer functionalists are of core importance in the communication process and so the routing with energy aware trait is indispensable for improved network performance and increased network lifetime. Designing of protocol at this under discussion layer must consider the aforementioned factors especially for energy aware routing process. In wireless sensor networks there may be hundreds or thousands of sensor nodes communicating with each other and with the base station, which consumes more energy in exchanging data and information with the additive issues of unbalanced load and intolerable faults. Two main types of network architectures for sensed data dissemination from source to destination exist in the literature; Flat network architecture, clustered network architecture. In flat architecture based networks, uniformity can be seen since all the network nodes work in a same mode and generally do not have any distinguished role.

Energy Efficient Image Compression and Transmission in WSN

Wireless sensor networks are greatly habituated in widespread applications but still yet step behind human intelligence and vision. The main reason is constraints of processing, energy consumptions and communication of image data over the sensor nodes. Wireless sensor network is a cooperative network of nodes called motes. Image compression and transmission over a wide ranged sensor network is an emerging challenge with respect to battery, life time constraints. It reduces communication latency and makes sensor network efficient with respect to energy consumption. In this paper we will have an analysis and comparative look on different image compression techniques in order to reduce computational load, memory requirements and enhance coding speed and image quality. Along with compression, different transmission methods will be discussed and analyzed with respect to energy consumption for better performance in wireless sensor networks.

Causal and Total Order in Opportunistic Networks

Opportunistic network applications are usually assumed to work only with unordered immutable messages, like photos, videos or music files, while applications that depend on ordered or mutable messages, like chat or shared contents editing applications, are ignored. In this chapter, we examine how causal and total ordering can be achieved in an opportunistic network. By leveraging on existing dissemination algorithms, we investigate if causal order can be efficiently achieved in terms of hit rate and latency compared to not using any order. Afterwards, we propose a Commutative Replicated Data Type algorithm based on Logoot that uses the nature of opportunistic networks to its advantage. Finally, we present the results of the experiments for the new algorithm by using an opportunistic network emulator, mobility traces and chat traces.

A P2P Home-Box Overlay for Efficient Content Distribution

The overlay networks composed of residential gateways (i.e. home-box) leverage their storage and upload capacity to achieve scalable and cost-efficient content distribution. In this chapter, we present the architecture of the home-box overlay for video on demand services, with the network-aware request redirection and content caching strategy that optimizes the resource usage at both network and client side, for reducing the overall distribution cost. The proposed system is compared with existing solutions through comprehensive simulations. The results demonstrate the advantage of network-aware and popularity-based caching strategy, with reduced the overall cost of the VoD services.

Energy Efficient Congestion Control in Wireless Sensor Networks

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.

802.11p-Based VANET Applications Improving Road Safety and Traffic Management

In the last few years Intelligent Transportation Systems (ITS) based on wireless vehicular networks have been attracting interest, since they can contribute towards improving road transport safety and efficiency and ameliorate environmental conditions and life quality. In order to widely spread these technologies, standardization at each layer of the networking protocol stacks has to be done. Therefore, a suite of protocols along with the architecture for the wireless environments with vehicles has been developed and standardized. Both in the US as well as in Europe the selected wireless communication protocol has been the 802.11p protocol developed by the IEEE. In this chapter, we discuss the potential impact of ITS towards achieving the above targets of improving road safety and traffic control. We review the overall architecture and the protocol functionality and present in detail a number of applications that have been developed demonstrating selected use-cases on an 802.11p compliant system prototype. Specifically, we discuss the implementation of selected applications on the NEC's Linkbird-MX platform, which supports IEEE 802.11p based communications, showing how its functionality can be exploited to build efficient road safety and traffic management applications, and evaluate the performance of the system using an experimental testbed.

Cost Minimization of Sensor Placement and Routing in Wireless Sensor Networks

Wireless Sensor Nodes (WSNs) are small in size and have limited energy resources. Recent technological advances have facilitated widespread use of wireless sensor networks in many real world applications. In real life situations WSN has to cover an area or monitor a number of nodes on a plane. Sensor node's coverage range is proportional to their cost, as high cost sensor nodes have higher coverage ranges. The main goal of this paper is to minimize the node placement cost with the help of uniform and non-uniform 2D grid planes. Authors propose a new algorithm for data transformation between strongly connected sensor nodes, based on graph theory.

A Scheduling Scheme for Throughput Optimization in Mobile Peer-to-Peer Networks

Mobile Cloud Computing (MCC) paradigm includes all the emerging technological advances, mechanisms and schemes for the efficient resource offloading and the energy-efficient provision of services to mobile users. In addition, the mobile nodes will act as flexible networking points in emerging mobile networking architectures, where several challenges have to be addressed, like the high energy consumption and the data packets transmission failure, under a Mobile Peer-to-Peer (MP2P) approach. Towards addressing such challenges, several factors that contribute to the increased consumption of the energy, have to be investigated, as well as issues related with the loss of data during the provision of services. In this framework, a Traffic-based S-MAC scheme is proposed in this chapter, towards increasing the data exchange and minimize the energy consumption, between mobile nodes operating under an Ad-Hoc approach. The performance of the proposed scheduling scheme was thoroughly evaluated, through a number of simulation experiments.

Secure Node Localization in Clustered Sensor Networks with Effective Key Revocation

Wireless sensor networks are deployed in unattended and hostile environment for many applications such as battlefield surveillance. The WSN applications may require knowing the locations of the node in the network to assist in neighbour discovery, selective information sharing and so on. The trivial approach to node localization is to equip each node with GPS. However, the cost and size of GPS enabled nodes make it impractical for resource-constrained, low cost WSNs. GPS-free node localization has been addressed using two different approaches - Beacon Based (BB) and Without Beacon Based (WBB). In BB approach, few nodes aware of their locations serve as beacons to help other nodes in the network localize themselves. In WBB approach, nodes need to localize themselves with the help of their neighbours only. Although, knowledge of nodes' location within network is desirable, exposure of node location information to adversary may lead to undesirable consequences, such as ease of planning for node capture attack, and hence the need of secure localization. The BB approach has been studied extensively under adversarial model and many algorithms based on BB approach have been proposed in literature in order to localize nodes in a secure manner. In contrast, WBB approach for node localization under adversarial model has not received substantial attention from researchers. In this chapter, we discuss static and dynamic key settings for node localization using WBB for node localization under adversarial model. We consider the Localized Combinatorial Keying (LEAP) and Localized Encryption and Authentication Protocol (LEAP) as the building block and propose a protocol for pair-wise key establishment and key revocation to facilitate secure node localization without using beacon nodes in mobile sensor networks, aiming at providing resilience against node impersonation attack and thus minimizing the impact of node capture threats. We provide a comparison of the improved protocol with other related protocols. We show that the improved protocol provides effective node localization in a secure manner with minimal node capture threats.

Dynamic Priority Scheduling of Critical Data in Wireless Sensor Networks

In the unlicensed band, the notion of primary user and secondary user (to implement cognitive radio) is not explicit. By dynamic priority assignment we propose to implement cognitive radio in the unlicensed band. In time critical events, the data which is most important, has to be given the time slots. Wireless Sensor nodes in our case are considered to be mobile, and hence make it difficult to prioritize one over another. A node may be out of the reach of the cluster head or base station by the time it is allotted a time slot and hence mobility is a constraint. With the data changing dynamically and factors such as energy and mobility, which are major constraints, assigning priority to the nodes becomes difficult. In this chapter, we have discussed how Wireless Sensor Networks are able to allocate priorities to nodes in the unlicensed band with multiple parameters being posed. We have done simulations on NS-2 and have shown the implementation results.