Mobile Multimedia Streaming Using Secure Multipath in Wireless Ad Hoc Networks

Mobile Multimedia Streaming Using Secure Multipath in Wireless Ad Hoc Networks

Lei Chen, Chung-Wei Lee
Copyright: © 2012 |Pages: 21
DOI: 10.4018/978-1-61350-101-6.ch304
OnDemand:
(Individual Chapters)
Available
$37.50
Current Special Offers
No Current Special Offers
TOTAL SAVINGS: $37.50

Abstract

Supporting reliable and secure multimedia streaming service is a challenging task in the environment of wireless Mobile Ad hoc Networks (MANETs) where radio signals are prone to security attacks and the quality of media streaming is degraded by signal strength loss and interference. The mobility of mobile devices makes streaming even more difficult as communication links are often broken when the devices move out of the transmission range of their neighbors. This paper proposes a stable multipath routing algorithm and an intelligent secure data distribution scheme for multimedia streaming in MANETs. The multipath Neighbor Stability Routing is able to find more stable and long-lasting paths than traditional ad hoc routing algorithms. The secure data distribution takes historical data-path distribution into consideration and maximally disperses new multimedia data to reduce the possibility of information leakage to unauthorized parties. The authors’ simulation and analysis indicate that the combination of these two mechanisms can provide high quality paths to achieve secure multimedia streaming.
Chapter Preview
Top

2. Routing In Manets

MANETs consist of mobile wireless devices communicating through relatively unreliable wireless connections. This unreliability is mainly caused by device mobility and signal interference, both can degrade networking performance significantly.

2.1 Single-Path Routing

In order to achieve better reliability in MANETs, (Ye, Krishnamurthy, & Tripathi, 2003) introduced a reliable routing framework in which some reliable R-nodes are manually inserted into the MANETs and play a role of supporting the network as backbones. This idea could be practical in some metropolitan areas where advanced network infrastructures are available, but it is not suitable for other improvisational situations such as disaster rescue.

Noticing that information exchange is important among neighbor nodes, in (Joe & Batsell, 2002) Joe and Batsell introduced MPR-based hybrid routing which makes use of the multipoint relaying based on the information exchange among neighbor nodes. Nevertheless, this routing algorithm does not involve any memory of the relationship among neighbor nodes. Thus all nodes are treated the same no matter they are stable in terms of mobility or not.

Some other researchers have suggested that routing can be done by collecting and aggregating relative information among neighbor nodes from the source to the destination. For example, ABR in (Toh, 1997; Toh, Delwar, & Allen, 2002) makes use of the Associativity Ticks among neighbor nodes. The Associativity Ticks show a mobile node’s dormant time, in which the node is in a stable status. However, these Associativity Ticks are not able to show the long term accumulated relationship among neighbors.

Complete Chapter List

Search this Book:
Reset