Abstract-This work explores grid-based coordinated routing in wireless sensor networks and compares the energy available in the network over time for different grid sizes. A test area is divided into square-shaped grids of certain length. Fully charged battery powered nodes are randomly placed in the area with a fixed source and sink nodes. One node per grid is elected as the coordinator which does the actual routing. The source node starts flooding the network with every coordinator joining in the routing. Once the flooding reaches the sink node, information is sent back to the source by finding the back route to the source. This process is continued until a node (coordinator) along that route runs out of energy. New coordinators are elected to replace the depleted ones. The source node refloods the network so that the sink can find a new back route to send information. This entire process continues until the network is partitioned and the connectivity between the source and the sink nodes is lost. We explore the quality of service of wireless sensor networks, how the coordinator nodes are elected, and the size of the grid area that will minimize the total energy consumption and extend the lifetime of the network.
In 2007, Akl and Sawant REF proposed a Grid-based Coordinated Routing protocol, where any one node in each grid is elected to act as the coordinator node.
Grid-based Coordinated Routing in Wireless Sensor Networks
2007 4th IEEE Consumer Communications and Networking Conference
2007 4th IEEE Consumer Communications and Networking Conference
Computer Science