Relation-based Message Routing in Wireless Sensor Networks

Sensor networks and their related topics represent some of the greatest and challenging possibilities in the research field that have come about in recent years. Emerging technologies like wireless sensor network (WSN), standards enabled legacy sensors, ubiquitous and cloud computing, middleware, communication systems, internet protocols (IP) and next generation networks are leading to a set of new paradigms where wireless sensors can be treated as vital components of common infrastructure and a shared resource with an ability to serve multiple and concurrently executing applications run by various users in distributed environment. This is in strong contrast to traditional concepts where dedicated sensor devices are being physically and logically hard-wired to communication and computing infrastructure serving very specific and dedicated data/information processing applications. Wireless sensor networks consist of a number of small electronic devices (nodes) distributed in an area that by far exceeds the communication range of a single sensor. Message routing is one of the most important issues in such networks. This is mainly due to the large number of nodes, variety of possible communication paths, restricted power source and variability (in time and space) of environmental conditions in which the WSN operates. A shared communication channel and restricted communication ranges require that nodes of the WSN cooperate and/or coordinate their actions while messages are routed from nodes to the base station (BS). It is a well-known idea Descartes & Lafleur (1960) to solve large and complex problems by dividing them into smaller and possibly simpler tasks. The most crucial element of such an attempt is to decide how to divide the problem in order to get a problem that can be solved efficiently and, what is more important, can be used to find a solution to the original problem. A distributed system, such as a WSN, is traditionally seen as a set of spatially distributed nodes that communicate, coordinate their actions and inform other nodes about their status using special messages sent over the communication channel Dollimore et al. (2005). Such a system is usually assumed to be isolated from the outside word – even if it measures its parameters and/or listens to the status messages from other nodes, it is still not affected by the environmental conditions and its changes. We are going to look at such a system as it 7

[1]  Zenon Chaczko,et al.  Directed Cooperation in Multihop Wireless Sensors Network , 2010 .

[2]  Jan Nikodem,et al.  Autonomy and Cooperation as Factors of Dependability in Wireless Sensor Network , 2008, 2008 Third International Conference on Dependability of Computer Systems DepCoS-RELCOMEX.

[3]  Ossama Younis,et al.  HEED: a hybrid, energy-efficient, distributed clustering approach for ad hoc sensor networks , 2004, IEEE Transactions on Mobile Computing.

[4]  George Coulouris,et al.  Distributed systems - concepts and design , 1988 .

[5]  Jerzy. Jaroń,et al.  Systemic prolegomena to theoretical cybernetics , 1978 .

[6]  Mike Burmester,et al.  Adaptive gossip protocols: Managing security and redundancy in dense ad hoc networks , 2007, Ad Hoc Networks.

[7]  Deborah Estrin,et al.  Rumor routing algorthim for sensor networks , 2002, WSNA '02.

[8]  A. Manjeshwar,et al.  TEEN: a routing protocol for enhanced efficiency in wireless sensor networks , 2001, Proceedings 15th International Parallel and Distributed Processing Symposium. IPDPS 2001.

[9]  René Descartes,et al.  Discourse on Method and Meditations , 1960 .

[10]  Jan Nikodem Relational Approach Towards Feasibility Performance for Routing Algorithms in Wireless Sensor Network , 2009, 2009 Fourth International Conference on Dependability of Computer Systems.