Abstract
This chapter describes the implementation and performance evaluation of a novel routing protocol called Pandora, which is designed for social applications. This protocol can be implemented in a broad number of devices, such as commercial wireless routers and laptops. It also provides a robust backbone integrating and sharing data, voice and video between computers and mobile devices. Pandora offers great performance with both fixed and mobile devices and includes important features such as: geographic positioning, residual battery energy monitoring, and bandwidth utilization. In addition, Pandora also considers the number of devices attached to the network. Pandora is experimentally evaluated in a testbed with laptops for the first stage and commercial wireless routers for the second stage. The main goal of Pandora is to provide a reliable backbone for social applications requiring a quality of service (QoS) guarantee. With this in mind, the following evaluation of Pandora considers the following types of traffic sources: transport control protocol (TCP), voice, video and user datagram protocol (UDP) without marks. Pandora is also compared with different queuing disciplines, including: priority queuing discipline (PRIO), hierarchical token bucket (HTB) and DSMARK. Finally, an Internet radio transmission is employed to test the network re-configurability. Results show that queuing the PRIO and HTB disciplines, which prioritizes UDP traffic, performed the best.
TopState Of The Art Of Routing Algorithms For Wireless Mesh Networks
An infrastructure for social networks can be easy deployed using wireless mesh technologies. However, the heart of such wireless mesh technologies is their routing algorithms. Several wireless mesh routing protocols have been reported in the literature. The mobile mesh border discovery protocol (MMBDP), which is a robust, scalable, and efficient mobile ad hoc routing protocol based on the “link state” approach is presented in (Grace, 2000). A node periodically broadcasts its own link state packet (LSP) on each interface participating in the protocol. LSPs are relayed by nodes, thus allowing each node to have full topology information for the entire ad hoc network. From its topology database, a node is able to compute least cost unicast routes to all other nodes in the mobile ad hoc network.
Key Terms in this Chapter
AODV: Ad hoc On-demand Distance Vector
MMBDP: Mobile Mesh Border Discovery Protocol
AOMDV: Ad hoc On-demand Multi-path Distance Vector
NBB: Network Backbone
PRP: Pandora Routing Protocol
DS: Differentiated Services
EED: End-to-End Delay
UDP: User Datagram Protocol
Pandora: is a routing protocol for wireless mesh networks. The backbone nodes employ a proactive routing strategy, which is based on an adaptation of the Dijkstra Algorithm, also known as Dijkstra’s Shortest-path Algorithm
IP: Internet Protocol
Online Social Network: can be defined as a group of individuals or organizations called nodes that use the Internet as a communication medium, forming a social structure with a series of particular social relations.
PRIO: Priority Queuing Discipline
TBRPF: Topology Dissemination Based on Reverse-Path Forwarding:
LSP: Link State Packet
HTB: Hierarchical Token Bucket
WLAN: Wireless Local Area Network
Wireless Mesh Network: is composed of wireless mesh clients (WMCs) and wireless mesh routers (WMRs), with a backbone connection between the WMRs.
CBQ: Class-Based Queuing
QoS: Quality of Service
TCP: Transport Control Protocol
VOIP: Voice over Internet Protocol
DSR-MP: Dynamic Source Routing Multi-Path
MAC: Medium Access Control
NROOTs: Network Roots
IROOT: Internet Root
AODV-HM: An-hoc On-demand Distance Vector Hybrid Mesh