Adjacency Matrix Based Energy Efficient Scheduling using S-MAC Protocol in Wireless Sensor Networks

Communication is the main motive in any Networks whether it is Wireless Sensor Network, Ad-Hoc networks, Mobile Networks, Wired Networks, Local Area Network, Metropolitan Area Network, Wireless Area Network etc, hence it must be energy efficient. The main parameters for energy efficient communication are maximizing network lifetime, saving energy at the different nodes, sending the packets in minimum time delay, higher throughput etc. This paper focuses mainly on the energy efficient communication with the help of Adjacency Matrix in the Wireless Sensor Networks. The energy efficient scheduling can be done by putting the idle node in to sleep node so energy at the idle node can be saved. The proposed model in this paper first forms the adjacency matrix and broadcasts the information about the total number of existing nodes with depths to the other nodes in the same cluster from controller node. When every node receives the node information about the other nodes for same cluster they communicate based on the shortest depths and schedules the idle node in to sleep mode for a specific time threshold so energy at the idle nodes can be saved.Comment: 20 pages, 2 figures, 14 tables, 5 equations, International Journal of Computer Networks & Communications (IJCNC),March 2012, Volume 4, No. 2, March 201

Power saving mechanism with less number of nodes in the routing path in Adhoc Wireless Networks using MARI Algorithm

Adhoc wireless networks have emerged as one of the key growth areas for wireless3 networking and computing technology. Adhoc networks are a new wireless networking paradigm for mobile hosts. Unlike traditional mobile wireless networks, adhoc networks do not rely on any fixed infrastructure. Instead, hosts rely on each other to keep the network connected. The nodes in ad-hoc networks are battery operated and have limited energy resources, which is indeed a key limitations. Each node consumes a large amount of energy while transmission or reception of packets, among the nodes. While the nodes depend on each other for efficient transferring of packets, it is a key issue in adhoc networks to have efficient methods for forwarding of packets between any given pair of nodes, with minimum power consumption and less number of intermediate nodes . In this study we propose an optimal routing protocol called MARI (Mobile Agent with Routing Intelligence). The MARI Topology proposed for power management is novel and is used for the consumption of minimum power in an adhoc wireless network, at each node. The Protocol groups the network into distinct networks with the selection of MARI nodes and Gateways for efficient packet transmission between any member node pair. The operational cycle at each node is classified into four distinct operations, i.e., transmitting, receiving, idle and sleep cycle, in order to achieve efficient power management in an Adhoc wireless network

Approximation Algorithms for Multi-Point Relay Selection in Mobile Wireless Networks

Routing is one of the main problems for Mobile Wireless Networks. In the case of infrastructureless multihop wireless networks, the selection of Multi-Point Relays provides efficient routing schemes. As such a selection is NP-hard, an efficient heuristic has been designed and effectively implemented in protocols for Mobile Ad Hoc Networks such as the Optimized Link State Routing protocol (OLSR). In this paper, we introduce two variants of this practical heuristic by exploiting the topological properties of the network (without assuming a knowledge of geographic positions or geometric properties). For each heuristic, we give their respective guaranteed approximation performances when compared to a solution of optimal value. We argue that the heuristics proposed are of considerable interest when other problems are considered in addition to the routing efficiency (e.g., minimum remaining bandwidth, minimum remaining energy,...)

A Review Article on Energy Efficient Routing Algorithm in MANETs

With the rapid evolution in the mobile computing field, the new alternatives are derived in which mobile devices form a self-creating, self-administering and self-organising wireless networks. Mobile Ad Hoc Network (MANET) is one such arbitrary network in which all the nodes are mobile and consists of limited battery power and channel bandwidth. These Ad Hoc networks are often used in emergency situations. The frequent change in topology leads to more consumption of energy, therefore saving power in such situations is of prime importance. In this paper, we will try to make some improvements in the already exciting energy efficient routing protocols in order to get better results. We will find minimum distance from source to destination by changing the route request phase. In this way, the energy of nodes with not suffers from inefficiency. Keywords: AODV, Mobile Ad hoc Networks, Energy Efficiency and Routing

Deadline-Aware Energy-Efficient Query Scheduling in Wireless Sensor Networks with Mobile Sink

Mobile sinks are proposed to save sensor energy spent for multihop communication in transferring data to a base station (sink) in Wireless Sensor Networks. Due to relative low speed of mobile sinks, these approaches are mostly suitable for delay-tolerant applications. In this paper, we study the design of a query scheduling algorithm for query-based data gathering applications using mobile sinks. However, these kinds of applications are sensitive to delays due to specified query deadlines. Thus, the proposed scheduling algorithm aims to minimize the number of missed deadlines while keeping the level of energy consumption at the minimum