Professional Documents
Culture Documents
Lecture7 Topology
Lecture7 Topology
– Energy/Power consumption
– Interference
– Throughput
– Connectivity
Mobility-Adaptive Protocols for Managing Large Ad hoc
Networks
[Basagni+ 2001]
B-Protocol
• Also known as backbone protocols
• Sets up and maintains a connected network (B-network)
• B-network convey the time-sensitive network management information
• from every node in the network with minor overhead and in a
timely manner
• Comprises two major tasks:
(a) B-nodes selection
(b) B-links establishment
Nodes that are not selected as B-nodes are termed F- nodes that belong to the
flat network
Mobility-Adaptive Protocols for Managing Large Ad hoc
Networks
B-nodes Selection
Illustrative Example:
6(1)
4(9) 2(3)
1(6) 7(5)
3(2)
5(8)
8(1)
Numbers represent node IDs and numbers within parentheses represent the node weights
Mobility-Adaptive Protocols for Managing Large Ad hoc
Networks
B-nodes Selection
Illustrative Example:
6(1)
4(9) 2(3)
5(8) 3(2)
B-node 8(1)
Mobility-Adaptive Protocols for Managing Large Ad hoc
Networks
B-links Establishment
B-links Establishment
Properties of B-protocol
1. Each node in flat network knows only its one-hop neighbors. This
induces the minimum possible overhead
2. B-link establishment is run at each B-node only with no knowledge of
the surrounding B-nodes. Again, this induces the minimum overhead
3. Every B-node serves a number of F-nodes each of which is at most
three-hops away. B-node selection protocol guarantees that all the F-
nodes are served by only one neighboring B-node
4. There are no two B-nodes that are neighbors in the flat network. This
guarantees that B-nodes are evenly distributed in the network
5. B-node selection is based on the node’s current status (weight)
Mobility-Adaptive Protocols for Managing Large Ad hoc
Networks
Properties of B-protocol
Simulation Environment
Simulation Results
Simulation Results
Simulation Results
– If many nodes are willing to become coordinators, SPAN solves this contention by
delaying coordinator announcement with a randomized backoff delay
– Each node selects a delay value and delays sending HELLO message indicating
the desire to become coordinator for that amount of time
– At the end of the delay, the node reevaluates its eligibility based on the HELLO
messages received from neighbors and if it is still eligible, it makes announcement
SPAN
Coordinator Announcement
– At the end of the delay, the node reevaluates its eligibility based on the HELLO
messages received from neighbors and if it is still eligible, it makes announcement
– Consider a case where all the nodes have the same level of energy which means
that only topology is considered in the decision of becoming a coordinator
Eq. 1
Eq. 2
WT = 3 x N i x T
SPAN
Coordinator Withdrawal
– If the coordinator has not withdrawn within W T time period, it clears its tentative bit
– In order to prevent node to drain its battery completely, the amount time a node acts
as a coordinator before turning on its tentative bit is proportional to the amount of
energy it has, indicated as (Er/Em)
SPAN
Simulation Results
ASCENT: Adaptive Self-Configuring sEnsor Networks
Topologies
[Cerpa+ 2002]
– ASCENT does not use localized distributed algorithm to find a single solution
– Adaptive self-configuration using localized is suited to problem spaces which
have a vast number of possible solutions (in this case, large solution spaces
means dense node deployment)
– ASCENT has the following two assumptions:
Carrier Sense Multiple Access (CSMA) MAC protocol
Possibilities for resource contention when too many neighboring
nodes participate in the multi-hop network
Reacts when links have high packet loss
Does not detect or repair network partitions and assumes that there
is enough node density to connect the entire region
ASCENT
ASCENT Design
ASCENT Design
– When source starts transmitting data packets towards the sink, the sink gets
high message loss from the source due to limited radio range, called
communication hole
– The receiver gets high packet loss due to poor connectivity with the sender
– Sink start sending help messages to neighbors that are in listen-only mode,
called passive neighbors, to join the network
Help
Messages
Data Message
Passive Neighbor Active Neighbor
Source
Sink
– When a neighbor receive a help message, it decides to join the network or not
– If the node joins, it becomes an active neighbor and signals the existence of a new
active neighbor to other passive neighbors by sending a neighbor announcement
message
– It continues until the number of active nodes stabilizes on a certain value and the
cycle stops
– When the process is completed, the newly joined nodes participate in the data
delivery process from source to sink more reliably
– The process will be repeated in the case of network event (e.g., node failure) or
environmental effect (e.g., new obstacle) causes message loss
Neighbor Data
Announcements Message
Messages
Source Sink
Source Sink
after Tt
Test Active
after Tp
Passive Sleep
after Ts
NT: neighbor threshold
LT: loss threshold
T?: state timer values (p: passive, s: sleep, t: test)
DL: Data loss rate
ASCENT
ASCENT State Transactions
– The reasoning behind the passive state is to gather information about the state of
the network without causing interference with other nodes
– Nodes in passive and test states update the number of active neighbors and data
loss rates
– In passive states, the nodes still consume energy since the radio is on
– The nodes in sleep state turns the radio off, sets up timer Ts and goes to sleep
– When Ts expires, the nodes moves into passive state
– A node in the active state continuous to forward data and routing packets until it
runs out of energy
ASCENT
ASCENT Parameters Tuning
– ASCENT has many parameters and the choices are left to the applications such as
a particular application may trade energy savings for greater sensing coverage
[Cerpa+ 2002] A. Cerpa and D. Estrin, ASCENT: Adaptive Self-Configuring Sensor Networks
Topologies, Proceedings of the Twenty First International Annual Joint Conference of the IEEE
Computer and Communications Societies (INFOCOM 2002), New York, NY, USA, June 23-27
2002.