Decentralized and Adaptive Sensor Data Routing

• Main Author: Zhu, Mengxia
• Other Authors: Rajgopal Kannan
• Format: Others
• Language: en
• Published: LSU 2002
• Subjects: Computer Science
• Online Access: http://etd.lsu.edu/docs/available/etd-1112102-134210/

Wireless sensor network (WSN) has been attracting research efforts due to the rapidly increasing applications in military and civilian fields. An important issue in wireless sensor network is how to send information in an efficient and adaptive way. Information can be directly sent back to the base station or through a sequence of intermediate nodes. In the later case, it becomes the problem of routing. Current routing protocols can be categorized into two groups, namely table-drive (proactive) routing protocols and source-initiated on-demand (reactive) routing. For ad hoc wireless sensor network, routing protocols must deal with some unique constraints such as energy conservation, low bandwidth, high error rate and unpredictable topology, of which wired network might not possess. Thus, a routing protocol, which is energy efficient, self-adaptive and error tolerant is highly demanded. A new peer to peer (P2P) routing notion based on the theory of cellular automata has been put forward to solve this problem. We proposed two different models, namely Spin Glass (Physics) inspired model and Multi-fractal (Chemistry) inspired model. Our new routing models are distributed in computation and self-adaptive to topological disturbance. All these merits can not only save significant amount of communication and computation cost but also well adapt to the highly volatile environment of ad hoc WSN. With the cellular automata Cantor modeling tool, we implemented two dynamic link libraries (DLL) in C++ and the corresponding graphic display procedures in Tcl/tk. Results of each models routing ability are discussed and hopefully it will lead to new peer to peer algorithms, which can combine the advantages of current models.