Santhosh Kumar, G; Vinu Paul, M V; Athithan, G; Poulose Jacob,K(IEEE, November 19, 2008)
[+]
[-]
Abstract:
In wireless sensor networks, the routing
algorithms currently available assume that the sensor nodes are
stationary. Therefore when mobility modulation is applied to the
wireless sensor networks, most of the current routing algorithms
suffer from performance degradation. The path breaks in mobile
wireless networks are due to the movement of mobile nodes, node
failure, channel fading and shadowing. It is desirable to deal with
dynamic topology changes with optimal effort in terms of
resource and channel utilization. As the nodes in wireless sensor
medium make use of wireless broadcast to communicate, it is
possible to make use of neighboring node information to recover
from path failure. Cooperation among the neighboring nodes
plays an important role in the context of routing among the
mobile nodes. This paper proposes an enhancement to an existing
protocol for accommodating node mobility through neighboring
node information while keeping the utilization of resources to a
minimum.
In wireless sensor networks, the routing
algorithms currently available assume that the sensor nodes are
stationary. Therefore when mobility modulation is applied to the
wireless sensor networks, most of the current routing algorithms
suffer from performance degradation. The path breaks in mobile
wireless networks are due to the movement of mobile nodes, node
failure, channel fading and shadowing. It is desirable to deal with
dynamic topology changes with optimal effort in terms of
resource and channel utilization. As the nodes in wireless sensor
medium make use of wireless broadcast to communicate, it is
possible to make use of neighboring node information to recover
from path failure. Cooperation among the neighboring nodes
plays an important role in the context of routing among the
mobile nodes. This paper proposes an enhancement to an existing
protocol for accommodating node mobility through neighboring
node information while keeping the utilization of resources to a
minimum.
Embedded systems, especially Wireless Sensor Nodes
are highly prone to Type Safety and Memory Safety issues.
Contiki, a prominent Operating System in the domain is even
more affected by the problem since it makes extensive use of
Type casts and Pointers. The work is an attempt to nullify the
possibility of Safety violations in Contiki. We use a powerful,
still efficient tool called Deputy to achieve this. We also try to
automate the process
Description:
2009 International Conference on Advances in Recent Technologies in Communication and Computing
Embedded systems, especially Wireless Sensor Nodes
are highly prone to Type Safety and Memory Safety issues.
Contiki, a prominent Operating System in the domain is even
more affected by the problem since it makes extensive use of
Type casts and Pointers. The work is an attempt to nullify the
possibility of Safety violations in Contiki. We use a powerful,
still efficient tool called Deputy to achieve this. We also try to
automate the process
Description:
2009 International Conference on Advances in Recent Technologies in Communication and Computing