Party: Pastry-like multi-hop routing protocol for wireless self-organizing networks

Ghazi Al Sukkar; Hossam Afifi; Sidi Mohammed Senouci

doi:10.1109/MCWC.2006.4375187

Party: Pastry-like multi-hop routing protocol for wireless self-organizing networks

Ghazi Al Sukkar
, Hossam Afifi
, Sidi Mohammed Senouci

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

Abstract

In this paper we propose Party, a new routing protocol for wireless Self-Organizing Networks. This protocol is intended to be applied in environments with large number of nodes where the scalability of the routing protocols plays an important issue; it is well known that the current ad hoc routing protocols do not scale to work efficiently in networks of more than a few hundred nodes. In Party, nodes build, a network infrastructure which allocates each node a unique temporary address according to its current relative location, our routing is also unique and only depends on the current node's neighborhood, where in order to implement the routing table, each node needs only to exchange local information with its direct neighbors.

Original language	English
Title of host publication	Mobile Computing and Wireless Communications International Conference, MCWC 2006
Pages	2-7
Number of pages	6
DOIs	https://doi.org/10.1109/MCWC.2006.4375187
Publication status	Published - 1 Dec 2006
Externally published	Yes
Event	Mobile Computing and Wireless Communications International Conference, MCWC 2006 - Amman, Jordan Duration: 17 Sept 2006 → 20 Sept 2006

Publication series

Name	Mobile Computing and Wireless Communications International Conference, MCWC 2006

Conference

Conference	Mobile Computing and Wireless Communications International Conference, MCWC 2006
Country/Territory	Jordan
City	Amman
Period	17/09/06 → 20/09/06

Keywords

Ad hoc networks
Distributed hash tables
Dynamic address allocation
Location service
Mesh networks
Multi-hop routing
Peer to peer communication
Self organizing networks

Access to Document

10.1109/MCWC.2006.4375187

Cite this

Al Sukkar, G., Afifi, H., & Senouci, S. M. (2006). Party: Pastry-like multi-hop routing protocol for wireless self-organizing networks. In Mobile Computing and Wireless Communications International Conference, MCWC 2006 (pp. 2-7). Article 4375187 (Mobile Computing and Wireless Communications International Conference, MCWC 2006). https://doi.org/10.1109/MCWC.2006.4375187

@inproceedings{808c5a2a4edf479d97a1546e767b7a05,

title = "Party: Pastry-like multi-hop routing protocol for wireless self-organizing networks",

abstract = "In this paper we propose Party, a new routing protocol for wireless Self-Organizing Networks. This protocol is intended to be applied in environments with large number of nodes where the scalability of the routing protocols plays an important issue; it is well known that the current ad hoc routing protocols do not scale to work efficiently in networks of more than a few hundred nodes. In Party, nodes build, a network infrastructure which allocates each node a unique temporary address according to its current relative location, our routing is also unique and only depends on the current node's neighborhood, where in order to implement the routing table, each node needs only to exchange local information with its direct neighbors.",

keywords = "Ad hoc networks, Distributed hash tables, Dynamic address allocation, Location service, Mesh networks, Multi-hop routing, Peer to peer communication, Self organizing networks",

author = "\{Al Sukkar\}, Ghazi and Hossam Afifi and Senouci, \{Sidi Mohammed\}",

year = "2006",

month = dec,

day = "1",

doi = "10.1109/MCWC.2006.4375187",

language = "English",

isbn = "9957486004",

series = "Mobile Computing and Wireless Communications International Conference, MCWC 2006",

pages = "2--7",

booktitle = "Mobile Computing and Wireless Communications International Conference, MCWC 2006",

note = "Mobile Computing and Wireless Communications International Conference, MCWC 2006 ; Conference date: 17-09-2006 Through 20-09-2006",

}

Al Sukkar, G, Afifi, H & Senouci, SM 2006, Party: Pastry-like multi-hop routing protocol for wireless self-organizing networks. in Mobile Computing and Wireless Communications International Conference, MCWC 2006., 4375187, Mobile Computing and Wireless Communications International Conference, MCWC 2006, pp. 2-7, Mobile Computing and Wireless Communications International Conference, MCWC 2006, Amman, Jordan, 17/09/06. https://doi.org/10.1109/MCWC.2006.4375187

Party: Pastry-like multi-hop routing protocol for wireless self-organizing networks. / Al Sukkar, Ghazi; Afifi, Hossam; Senouci, Sidi Mohammed.
Mobile Computing and Wireless Communications International Conference, MCWC 2006. 2006. p. 2-7 4375187 (Mobile Computing and Wireless Communications International Conference, MCWC 2006).

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

TY - GEN

T1 - Party

T2 - Mobile Computing and Wireless Communications International Conference, MCWC 2006

AU - Al Sukkar, Ghazi

AU - Afifi, Hossam

AU - Senouci, Sidi Mohammed

PY - 2006/12/1

Y1 - 2006/12/1

N2 - In this paper we propose Party, a new routing protocol for wireless Self-Organizing Networks. This protocol is intended to be applied in environments with large number of nodes where the scalability of the routing protocols plays an important issue; it is well known that the current ad hoc routing protocols do not scale to work efficiently in networks of more than a few hundred nodes. In Party, nodes build, a network infrastructure which allocates each node a unique temporary address according to its current relative location, our routing is also unique and only depends on the current node's neighborhood, where in order to implement the routing table, each node needs only to exchange local information with its direct neighbors.

AB - In this paper we propose Party, a new routing protocol for wireless Self-Organizing Networks. This protocol is intended to be applied in environments with large number of nodes where the scalability of the routing protocols plays an important issue; it is well known that the current ad hoc routing protocols do not scale to work efficiently in networks of more than a few hundred nodes. In Party, nodes build, a network infrastructure which allocates each node a unique temporary address according to its current relative location, our routing is also unique and only depends on the current node's neighborhood, where in order to implement the routing table, each node needs only to exchange local information with its direct neighbors.

KW - Ad hoc networks

KW - Distributed hash tables

KW - Dynamic address allocation

KW - Location service

KW - Mesh networks

KW - Multi-hop routing

KW - Peer to peer communication

KW - Self organizing networks

UR - https://www.scopus.com/pages/publications/47249162439

U2 - 10.1109/MCWC.2006.4375187

DO - 10.1109/MCWC.2006.4375187

M3 - Conference contribution

AN - SCOPUS:47249162439

SN - 9957486004

SN - 9789957486006

T3 - Mobile Computing and Wireless Communications International Conference, MCWC 2006

SP - 2

EP - 7

BT - Mobile Computing and Wireless Communications International Conference, MCWC 2006

Y2 - 17 September 2006 through 20 September 2006

ER -

Party: Pastry-like multi-hop routing protocol for wireless self-organizing networks

Abstract

Publication series

Conference

Keywords

Access to Document

Other files and links

Fingerprint

Cite this