1. INTRODUCTION 1.

1 PROJECT IDEA: As connectivity is subject to changes because of disruptions in wireless communication though sensor is aware of its immediate neighbours it must continuously maintain its view, a process we call continuous neighbour discovery. In this we are detecting hidden nodes by using the HELLO messages and once the hidden node is detected then we are maintaining it active throughout its life cycle by using SYNC messages. The optimal rout is determined in order to perform communication between the nodes, and if the link between the nodes is down due to some disruptions then we are performing re-link establishment in nodes to keep the network active. 1.2 MOTIVATION OF THE PROJECT: As the node connectivity is subject to changes because of disruptions in wireless communication, transmission power changes or loss of synchronization between neighbouring nodes there is major communication problem, so the problem must be resolved in order to have the efficient quality communication. This is achieved by continuous neighbour discovery i.e. to detect the immediate neighbour surrounded by a node and to maintain it active throughout its life. 1.3 LITERATURE SURVEY In Literature survey before developing the tool it is necessary to determine the time factor. Once these things are satisfied, then next steps are to determine which operating system and language can be used for developing the tool. Once the programmers start building the tool the programmers need lot of external support. Before building the system the above consideration are into account for developing the proposed system. While previous works address initial neighbour discovery and continuous neighbour discovery as similar tasks, to be performed by the same scheme,

We claim that different schemes are required, for the following reasons: 1. Initial neighbour discovery is usually performed when the sensor has no clue about the structure of its immediate surroundings. In such a case, the sensor cannot communicate with the gateway and is therefore very limited in performing its tasks. The immediate surroundings should be detected as soon as possible in order to establish a path to the gateway and contribute to the operation of the network. Hence, in this state, more extensive energy use is justified. In contrast, continuous neighbour discovery is performed when the sensor is already operational. This is a long-term process, whose optimization is crucial for increasing network lifetime. 2. When the sensor performs continuous neighbour discovery, it is already aware of most of its immediate neighbours and can therefore perform it together with these neighbours in order to consume less energy. In contrast, initial neighbour discovery must be executed by each sensor separately.

2. PROBLEM STATENENT AND SCOPE

2.1 PROBLEM STATEMENT: The neighbour discovery is only performed when the sensor has no clue about the structure of its immediate surroundings. In such a case, the sensor cannot communicate with the gateway and is therefore very limited in performing its tasks. At every time it has to communicate to its gateway and searches for optimal route and its immediate neighbour therefore its causes overhead of delay this should be eliminated in order to have the efficient quality communication. 2.2 GOALS AND OBJECTIVES: To detect hidden nodes in segment. Maintain the hidden node active by using SYNC message. To find out the optimal route in segment. To transmit details of newly found hidden node to all other nodes in segment. Re-link establishment if any link is down. 2

To maintain the continuous neighbour inside segment

2.3 STATEMENT OF SCOPE: As the node connectivity is subject to changes because of disruptions in wireless communication even after a sensor is aware of its immediate neighbours it must continuously maintain its view, a process we call continuous neighbour discovery. In this work we distinguish between neighbour discovery during sensor network initialization and continuous neighbour discovery. Focusing on the latter and view it as a joint task of all the nodes in every connected segment. Each sensor employs a simple protocol in a coordinate effort to reduce power consumption without increasing the time required to detect hidden sensors. 2.4 MAJOR CONSTRAINTS: Detection of all hidden nodes: All the hidden nodes inside a segment are to be detected in order to have the proper communication. Optimal route: The optimal route is to be determined depending upon the metrics of route in order to have the efficient quality of communication. Synchronization: If any hidden node is waked up the details of its must be transferred to all the other nodes in order to find out the optimal route. 2.5 Technology and Associated Platforms: Hardware requirements: System Hard Disk Floppy Drive Monitor Mouse RAM : Pentium IV 2.4 GHz. : 40 GB. : 1.44 Mb. : 15 VGA Color. : Logitech. : 512 MB.

Software requirements:

 Operating system : Windows XP Professional. Coding Language : java

2.6 Area of Project:

The area of project is mainly related to the self configurable and re-link establishment using continuous neighbour discovery in asynchronous sensor networks, as the node connectivity is subject to changes because of disruptions in wireless communication, transmission power changes, or loss of synchronization between neighbouring nodes so our primary aim is to maintain the continuously view on its neighbour, a process we call continuous neighbour discovery

2.7 Technical Keywords:

HELLO messages SYNC messages Sensor node Neighbour Discovery Static Nodes

: Messages broadcast for nodes in listening states. : Messages broadcast for nodes in talking states. : parts of sensor network like electronic circuit for interfacing. : Model to discover hidden neighbours. : Nodes in which node connectivity remain static that is does not change with disruptions.

Immediate Neighbour Delay

: Just nearer node of current node. : Time by which neighbour discovery & messages is late or postponed.

Asynchronous Sensor Network: Network in which communication between sensors is asynchronous (Messages transmitted at a different clock rate)

3. MATHEMATICAL MODELING
Inputs for mathematical calculation are Input 1: Node u is in initial neighbour discovery state. Node v is in continuous neighbour discovery state. Input 2: A least portion of nodes size H is , where 0< <1. Process: Node u wakes up every TI seconds with period of time H & broadcasts HELLO messages and the nodes of segment S discovers u within a time period T with probability P. Each node v in the segment S is in continuous neighbour discovery state, where it wakes up every TN(v) seconds for a period of time equal to H and broadcasts HELLO messages. Output: Node u and Node v discover each other during a specific HELLO interval Of u by following Probability = (2H (1- )) / TN (v) Condition: If Node u wake up at time t for period H then Node v should wake up between t-H(1- ) and t+H(1- ) 5

Avg. time interval between two wakes up periods of v =TN (v) Discovery of nodes between each other by Probability = (2H (1- ) ) / TN(v) Where, TN (v): denotes wakes up time of v node in seconds in continuous neighbour discovery state. H : denotes period of time. : A least portion of nodes size H. Let n be the number of in-segment neighbours of u. For at least one of its n neighbours, Probability=1-(1-(2H (1- )/ TN (v))) n

Algorithm 1: Determines hidden node discovery inside segment Steps: 1. Allow two Node u & v to discover each other if they belong to a connected segment.

2. Whenever a new node is discovered by one of the segment nodes it can detect all the hidden links inside a segment.

3. For all segment members, the discovering node issues a special SYNC message asking them to periodically broadcast a group of HELLO messages.

4. The SYNC message passes over the already known wireless links of the segment for maintaining link between each other. Algorithm 2: Determines hidden node discovery outside segment Steps: 1. Random wake-up approach is to be considered to minimization of possibility of repeating collisions between the HELLO messages of nodes in the same segment.

2. Node u wakes up randomly, every T (u) seconds on the average, for a fixed period of time H. During Fixed period of time H, Node u broadcasts several HELLO messages.

3. At the same time, it listens for possible HELLO messages sent by new neighbour.

4. The value of T(u) is as follows

T (u) =TI, if node u is in the Init state. T (u) =TN, if node u is in the continuous neighbour discovery state.

4. SOFTWARE REQUIREMENTS SPECIFICATION

7

4.1 Introduction:

Java Programming Language: The Java programming language is a high-level

language that can be characterized by all of the following buzzwords: Simple Architecture neutral Object oriented Portable Distributed High performance Interpreted Multithreaded Robust Dynamic Secure With most programming languages, we either compile or interpret a program so that we can run it on our computer. The Java programming language is unusual in that a program is both compiled and interpreted. With the compiler, first we translate a program into an intermediate language called Java byte codes the platform-independent codes interpreted by the interpreter on the Java platform. The interpreter parses and runs each Java byte code instruction on the computer. Compilation happens just once; interpretation occurs each time the program is executed. The figure no. 1 illustrates how this works.

Fig No. 1: Java Programming Language

Java byte codes are the machine code instructions for the Java Virtual Machine (Java VM). Every Java interpreter, whether its a development tool or a Web browser that can run applets, is an implementation of the Java VM. Java byte codes help make write once, run anywhere possible. Compilation of program into byte codes on any platform that has a Java compiler. The byte codes can then be run on any implementation of the Java VM. That means that as long as a computer has a Java VM, the same program written in the Java programming language can run on Windows 2000, a Solaris workstation, or on an iMac as shown in Fig no 2.

Fig No 2: Java Program

4.2 Usage Scenario 1. Client Server 2. Neighbour Discovery Model 3. Detecting all hidden links Inside a segment 4. Detecting all hidden node Wake up 1. Client Server: Client Server computing is distributed access. Server accepts requests for data from client and returns the result to the client. By separating data from the computation processing, the compute servers processing capabilities can be optimized. Often clients and servers communicate over a computer network on separate hardware, but both client and server may reside in the same system. 2. Neighbour Discovery Model: Neighbour Discovery is studied for general ad-hoc wireless networks. A node decides randomly when to initiate the transmission of a HELLO message. If its message does not collide with another HELLO, the node is considered to be discovered. The goal is to determine the HELLO transmission frequency, and the duration of the neighbour discovery process. 3. Hidden link participate inside a segment: This scheme is invoked when a new node is discovered by one of the segment nodes. The discovering node issues a special SYNC message to all segment members, asking them to wake up and periodically broadcast a bunch of HELLO messages. This SYNC message is distributed over the already known wireless links of the segment. Thus, it is guaranteed to be received by every segment node and ensure that every wireless link between the segment's members will be detected.

10

4. Wake Up Hidden: A random wake-up approach is used to minimize the possibility of repeating collisions between the HELLO messages of nodes in the same segment. Theoretically, another scheme may be used, where segment nodes coordinate their wake-up periods to prevent collisions and speed up the discovery of hidden nodes. Since the time period during which every node wakes up is very short, and the HELLO transmission time is even shorter, the probability that two neighbouring nodes will be active at the same time.

4.2.1 User Profiles Client:

Activities1. Initialize connectivity 2. Browse & receive the data 3. Get recommended data

Server: Activities1. Initialize connectivity 2. Browse the data 3. Transfer recommended data Router:

Activities1. Select nodes 2. Select routes 3. Update router tables

11

4.2.2 Use Cases 1. Actor-Router:

Fig No 3: Actor-Router 12

2. Actor-Client and server

Fig No 4: Actor-Client and Server

3. Overall view of the system:

13

Fig No 5: Overall view of the system

14

4.3 Functional Model Description

4.3.1

Data Flow Diagram :

Fig No 6: Data Flow Diagram 15

4.3.2

Activity Diagrams :

16

Fig No 7: Activity Diagram

4.4

Behavioral Model Description 17

4.4.1 Description of Software Behavior

The software is mainly related to the self configurable and re-link establishment using continuous neighbour discovery in asynchronous sensor networks, as the node connectivity is subject to changes because of disruptions in wireless communication, transmission power changes, or loss of synchronization between neighbouring nodes so our primary aim is to maintain the continuously view on its neighbour, a process we call continuous neighbour discovery.

4.4.2 State Transition Diagram

Fig No 8: State Transition Diagram 18

PROJECT PLAN

5.1 Introduction

The Continuous Neighbour Discovery in Asynchronous Sensor Networks Project Plan will provide a definition of the project, including the projects goals and objectives.

5.2 Project Estimates Approximate cost of our project is Rs. 6000-7000. The time duration for coding and making project is approximately till March end.

5.2.1 Function Point Analysis Function Point Analysis is to evaluate a system's capabilities from a user's point of view. To achieve this goal, the analysis is based upon the various ways users interact with computerized systems. From a user's perspective a system assists them in doing their job by providing five basic functions. The five functions are divided in two parts data function and transactional functions. 1) Data Functions Internal logic files External interface files 2)Transactional Functions External Inputs External Outputs External Inquiries

19

5.2.2 Reconciled Estimation The Reconciling estimation means to produce a single estimate of effort, project duration, or cost. The total estimated effort for continuous neighbour discovery in wireless sensor network range from Rs. 4000-5000.

5.3 Risk Management

5.3.1Project Risks

Routers i.e. nodes may get disrupted:- Disruption in routers or nodes may result in loss of connectivity. Network Failures:- Networks may fail due to lack of synchronization between nodes. Heavy traffic:- May lead to loss of synchronization between nodes. Messages may collide with each other:- The messages may collide due to heavy traffic and disruption in adjacent nodes.
Disruption of wireless connectivity between adjacent nodes:- May lead to loss of connectivity in the network. Energy of the nodes may get exhausted:- May lead to the loss of established nodes.

20

 Project Completion and Estimated Project Schedule :-The project may exceed the estimated time decided for its completion

5.3.2 Risk Table Risk Routers i.e. nodes may get disrupted. Network Failures. Heavy traffic may lead to loss of synchronization between nodes. Messages may collide with each other. Disruption of wireless connectivity between adjacent nodes. Energy of the nodes may get exhausted Project completion Estimated Project Schedule Risk Level L/M/H L: less chances of disruption of nodes L: Minimum chance of network failure. L: No heavy traffic. L: Because of proper sync between nodes. L: Hidden nodes are re-discovered. L: Hidden nodes are re-discovered. H: Size of project may lead to a problem regarding its completion. H: May vary as per the requirements.

Table No 1: Risk Table

5.4 Risk Mitigation, Monitoring and Management (RMMM) Plan:

Risk 1: Routers i.e. nodes may get disrupted. Description: Disruption in routers or nodes may result in loss of connectivity. Mitigation/Monitoring/Management: 1. The impact of the risk is low. 21

2. Synchronisation will avoid the nodes from getting disrupted.

Risk 2: Network failures. Description: Networks may fail due to lack of synchronization between nodes. Mitigation/Monitoring/Management: 1. The impact of the risk is low. 2. Neighbouring nodes are discovered continuously so that networks dont fail

Risk 3: Heavy Traffic. Description: Heavy Traffic may lead to loss of synchronization between nodes. Mitigation/Monitoring/Management: 1. The impact of the risk is low. 2. Hidden links wake up and maintain connectivity which reduces traffic.

Risk 4: Messages may collide with each other. Description: The messages may collide due to heavy traffic and disruption in adjacent nodes. Mitigation/Monitoring/Management: 1. The impact of the risk is low. 2. Hello messages are broadcasted to wake up hidden links.

Risk 5: Disruption of wireless connectivity between adjacent nodes. Description: May lead to a loss of connectivity between networks. Mitigation/Monitoring/Management: 1. The impact of the risk is low. 22

2. Sensors continuously look for new neighbours to avoid disruptions.

Risk 6: Energy of nodes may get exhausted. Description: May lead to the loss of established nodes. Mitigation/Monitoring/Management: 1. The impact of the risk. 2. Neighbouring nodes continuously keep track of the adjacent nodes.

Risk 7: Project completion and estimated project schedule: Description: The project may exceed the estimated time decided for its completion. Mitigation/Monitoring/Management: 1. The impact of the high. 2. Comphrensive project management and team-work. 3. The entire project work will be distributed among the team members equally and maximum efforts will be taken to complete the project within desired time. 4. Created comprehensive project timeline with frequent baseline reviews. 5.5 Project Schedule 5.5.1 Time line Chart

23

Fig No 9: Timeline Chart Diagram

6. HIGH LEVEL DESIGN DOCUMENT 6.1 Introduction A high-level design provides an overview of a solution, platform, system, product, service, or process. Such an overview is important in a multi-project development to make sure that each supporting component design will be compatible with its neighbouring designs and with the big picture. The highest level solution design should briefly describe all platforms, 24

systems, products, services and processes that it depends upon and include any important changes that need to be made to them. A high-level design document will usually include a high-level architecture diagram depicting the components, interfaces and networks that need to be further specified or developed. The document may also depict or otherwise refer to work flows and/or data flows between component systems. In addition, there should be brief consideration of all significant commercial, legal, environmental, security, safety and technical risks, issues and assumptions. The idea is to mention every work area briefly, clearly delegating the ownership of more detailed design activity. Finally, every type of end-user should be identified in the high-level design.

6.2 Architectural Design

1. Client-Server: Client Server computing is distributed access. Server accepts requests for data from client and returns the result to the client. By separating data from the computation processing, the computer servers processing capabilities can be optimized. Often clients and servers communicate over a computer network on separate hardware, but both client and server may reside in the same system.

C lie nt1

Databas e S e rver + C ent ral Applic ation S erver

C lient2

. . .
C lie ntn

Fig No 10: Relationship between server and client applications

25

Fig No 11: Top-level architecture 2. Detecting all hidden links inside a segment: This scheme is invoked when a new node is discovered by one of the segment nodes. The discovering node issues a special SYNC message to all segment members, asking them to wake up and periodically broadcast a bunch of HELLO messages. This SYNC message is distributed over the already known wireless links of the segment. Thus, it is guaranteed to be received by every segment node. By having all the nodes wake up almost at the same time for a short period we can ensure that every wireless link between the segment's members will be detected. 3. Detecting all hidden links outside a segment: A random wake-up approach is used to minimize the possibility of repeating collisions between the HELLO messages of nodes in the same segment. Theoretically, another scheme may be used, where segment nodes coordinate their wake-up periods to prevent collisions and speed up the discovery of hidden nodes. Since the time period during which every node wakes up is very short, and the HELLO transmission time is even shorter, the probability that two neighbouring nodes will be active at the same time. 4. Neighbour discovery model: Neighbour Discovery is studied for general ad-hoc wireless networks. A node decides randomly when to initiate the transmission of a HELLO message. If its message does not collide with another HELLO, the node is considered to be discovered. The goal is to determine the HELLO transmission frequency, and the duration of the neighbour discovery process.

26

6.3 Data Design

6.3.1 Internal Software Data Structures (a) ARRAYS: An array is a very common type of data structure where in all elements must be of the same data type. Once defined, the size of an array is fixed and cannot increase to accommodate more elements. The first element of an array starts with zero. Using and array in program is a 3 step process 1) Declaring Array 2) Constructing Array 3) Initializing Array (b) SEQUENCES: A sequence is a one-dimensional array. To declare a sequence, you need to declare the type of the elements in the sequence, and optionally the maximum size of the sequence (c) ENUMERATIONS: An enumeration declares an ordered list of identifiers, whose values are assigned in ascending order according to their order in the enumeration. An enumeration is given a type name so that the elements of the enumeration can be referenced.

6.3.2 Global Data Structures

USER DEFINED DATA STRUCTURES:

The user can define own data structure for each module to maintain problem-specific data and any other information the user needs access to.

27

These complex data types include arrays, sequences, enumerations, and constructed data types you define yourself using structs and unions.

6.4 Component Design

6.4.1 Sequence Diagrams:

28

Fig No 12: Sequence Diagram

6.4.2 Class Diagrams 29

Fig No 13: Class Diagrams

6.4.3 Component Diagram

Route info

Server network

Sends the data

Client

status of link

Fig No 14: Component Diagram 30

6.5 External System Interfaces

6.5.1 Deployment Diagram

Fig No 15: Deployment Diagram

31

7.

CONCLUSION

We are working on a new problem in wireless asynchronous sensor network which is continuous neighbour discovery in asynchronous sensor network. Static sensor node increases the complexity in continuous neighbour discovery model. If the nodes in a connected segment work together on this task, hidden nodes are guaranteed to be detected within a certain probability P and a certain time period T, with reduced expended on the detection. We are proposing a scheme that works well when a new node is discovered by one of the segment node and randomly wake up of nodes. There are two estimated algorithms: determines hidden node discovery inside segment and determines hidden node discovery outside segment. Our focus is on implementing a simple protocol in a coordinate effort to reduce power consumption without increasing the time required to detect hidden sensors in our project. We are proposing our project to minimize disruptions in wireless communication, change in transmission power and loss of synchronization between neighbouring nodes of the existing system. We simulated a sensor network to analyze our algorithms and proposing that when the 32

hidden nodes are uniformly distributed in the area the simplest estimation algorithm is good enough.

8 ANNEXURE

8.1 Annexure A: Laboratory assignments on project 1. Designing of following diagrams: a. Use case diagram: A use case diagram is a set of scenarios tied together by a common user goal. The use case diagram is as show above in section 4.2.2. 33

b. Class diagram

: A class diagram provides a way to capture physical structure of a system. A class represents a group of things that have a common state and behavior. Class diagram is as shown in section 6.4.2. Activity diagram is a technique to describe procedural logic and work flow of the system. The work flow of our proposed system is as shown in section 4.3.2.

c. Activity diagram:

d. Sequence diagram: Sequence diagram show the interaction by showing each router and actor with a lifeline that runs vertically down the page and the ordering of messages. The diagram of our scenario is as shown in section 6.4.1. 2. Problem statement feasible using Satisfiability Analysis: The scope of the problem statement is analyzed (refer section 1.1 and 2). Accordingly we made mathematical model to implement the problem statement (refer section 3). 8.2 Annexure B:: Name of the conference/journal where paper can be published

1. Our Publication "Self Configurable Re-link Establishment using Continuous Neighbor Discovery in Asynchronous Sensor Networks " International Journal of Computer Science and Network (IJCSN) Volume 1,Issue 6, December 2012. 2. Paper to be published: 1. IJCSNS International Journal of Computer Science and Network Security. 2. Springer Journals. 3. Elsevier journals. 4. International Journal of Computational Science and Engineering IJCSE. 5. International Journal of Computer Science and Communication Networks (IJCSCN). REFERENCES

1. International Journal of Engineering Research and Development ISSN: 2278-067X, Volume 1, Issue 11 (July 2012), PP. 52-57, Object Oriented Approach to Continuous Neighbour 34

Discovery in Asynchronous Sensor Babu

Networks, T.V.Satya Sheela, N.T. Radha, P Suresh

2. International Journal of Distributed and Parallel Systems (IJDPS) Vol.3, No.4, July 2012 Self Configurable Re-link Establishment using Continuous Neighbour Discovery in Asynchronous Wireless Sensor Networks M.Sreedevi NADILLA KHADAR VALLI Dr. R. Seshadri 3. Reuven Cohen and Boris Kapchits, Continuous Neighbour Discovery in Asynchronous Sensor Networks, IEEE/ACM Transactions on Networking, Vol. 19, No.1, February 2011.

4. INTERNATIONAL JOURNAL OF COMPUTER APPLICATION ISSUE2, VOLUME 1 (FEBRUARY 2012) ISSN: 2250-1797 An Efficient Continuous Neighbour Discovery in Asynchronous Sensor Networks Siva Ramakrishna, B. Ganga Bhavani Associate professor BVC Engineering college Department of CSE,BVCEC. 5. International Journal of Engineering Research and Applications (IJERA) ISSN: 2248-9622 INCESSANT NEIGHBOUR DETECTION IN ASYNCHRONOUS SENSOR NETWORK K.Ramesh Rao, Dr.G.Prakash Babu, INTELLENGINEERING COLLEGE, Anantapur(AP) 6. [IJESAT] INTERNATIONAL JOURNAL OF ENGINEERING SCIENCE &ADVANCED TECHNOLOGY, ISSN: 22503676, NEIGHBOUR DISCOVERY IN YNCHRONOUS WIRELESS SENSOR NETWORKS, Tekkali,Srikakulam, Tekkali, Srikakulam, Aditya Institute of Technology And Management. 7. International Journal of Distributed and Parallel Systems (IJDPS) Vol.3, No.4,July 2012, Self Configurable Re-link Establishment using Continuous Neighbour Discovery in Asynchronous Wireless Sensor Networks, M.Sreedev, NADILLA KHADAR VALLI, Dr. R. Seshadri, Assoc. Prof., C.S.E, MITS,Madanapalle, A.P, M.Tech, MITS, Madanapalle, Director, Computer Center, S.V.U, Tirupati,

8. S. Vasudevan, J. Kurose, and D. Towsley, .On neighbour discovery in wireless networks with directional antennas,. in INFOCOM, vol. 4, 2005, pp. 2502.2512.

35

9. R. Madan and S. Lall, .An energy-optimal algorithm for neighbour discovery in wireless sensor networks,. Mob. Netw. Appl., vol. 11, no. 3, pp. 317.326, 2006. 10. M. J. McGlynn and S. A. Borbash, .Birthday protocols for low energy deployment and exible neighbour discovery in ad hoc wireless networks,. in MobiHoc: Proceedings of the 2nd ACM International Symposium on Mobile Ad Hoc Networking and Computing. New York, NY, USA: ACM Press, 2001, pp. 137.145. 11. D. Baker and A. Ephremides, .The architectural organization of a mobile radio network via a distributed algorithm,. in IEEE Transactions on Communications, vol. 29, Nov. 1981, pp. 1694.1701. 12. Keshavarzian and E. Uysal-Biyikoglu, .Energy-ef_cient link assessment in wireless sensor networks,. in INFOCOM, 2004. [6] E. B. Hamida, G. Chelius, and E. Fleury, .Revisiting neighbour discovery with interferences consideration,. in PE-WASUN, 2006, pp. 74.81. [7] S. A. Borbash, .Design considerations in wireless sensor networks,. Ph.D. dissertation, ISR, August 2004. 13. G. Alonso, E. Kranakis, R. Wattenhofer, and P. Widmayer, .Probabilistic protocols for node discovery in ad-hoc, single broadcast channel networks,. in IPDPS, 2003, p. 218. 14. C. Perkins, E. Belding-Royer, and S. Das, .Ad hoc on-demand distance vector (AODV) routing,. RFC 3561, July 2003. J. Haartsen, Bluetooth Baseband Speci_cationv. 1.0. 15. T. Salonidis, P. Bhagwat, L. Tassiulas, and R. O. LaMaire, .Distributed topology construction of bluetooth personal area networks,. in INFOCOM,2001,pp. 1577.1586. 16. IEEE 802.15.4: Wireless Medium Access Control (MAC) and Physical Layer(PHY) Speci_cations for Low-Rate Wireless Personal Area Networks (WPANs), IEEE 802.15 WPAN Task Group 4 (TG4), 2006. 17. P. Dutta and D. Culler, .Practical asynchronous neighbour discovery and rendezvous for mobile sensing applications,. in SenSys: Proceedings ofthe 6th ACM conference on Embedded network sensor systems. New York, NY: ACM Press, 2008, pp. 71.84. 18. J. Hill and D. Culler, .A wireless embedded sensor architecture for system-level optimization,. Technical report, U.C. Berkeley, 2001.

36