Sustained service lookup in areas of sudden dense population

Aly, Sherif G.; El-Nahas, Amal

doi:10.1002/wcm.427

Cited by 5 publications

(6 citation statements)

References 16 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…The mesh has following characteristics. First, the mesh structure is formed automatically since the co-located nodes are within the ad hoc communication range and thus incurs little construction/maintenance cost since nodes only need to keep the one-hop neighbor list 1 . Second, any two mesh neighbors can exchange data if they are within communication range.…”

Section: Mesh Structure Formation and Data Exchangementioning

confidence: 99%

“…If the received segment s is new to n 1 , then n 1 inserts s into its memory and n 1 's Metadata Management module updates the segment id list accordingly. 1 HELLO message is the overhead of data advertisement …”

Section: Mesh Structure Formation and Data Exchangementioning

confidence: 99%

“…There have been previous works on the combination of cellular and ad hoc networks to improve downloading bandwidth of mobile users [1] [18]. These approaches put new functionalities on the cellular telephony infrastructure such as a new scheduler, membership management, credit verification; and thus require a high cost of deployment.…”

Section: Related Workmentioning

confidence: 99%

“…Some recent research projects have focused on combining cellular and ad hoc connectivity on cellular devices [1,10,12,11,14,16]. Most of the published approaches are based on the construction of a tree of ad hoc nodes rooted at high-data-rate proxy nodes connected to the cellular network.…”

Section: Introductionmentioning

confidence: 99%

See 3 more Smart Citations

iShare: Exploiting opportunistic ad hoc connections for improving data download of cellular users

Nahrstedt

Rimac³

et al. 2010

2010 IEEE Globecom Workshops

View full text Add to dashboard Cite

This paper presents an Incentive-based Sharing (iShare) protocol that blends cellular and ad hoc networks for content dissemination services. With iShare, mobile users download content from a source via cellular links and at the same time form a mesh ad hoc network for peer-to-peer exchange of content data. The mesh remains robust to network dynamics, minimizes ad hoc communication overhead, and parallelizes the downloading process among mesh members. In order to counter selfish behavior, we apply an efficient and practical "titfor-tat" incentive mechanism, which exploits proximity and mutual content interest of mobile users. This mechanism becomes particularly effective in the case of network dynamics since we utilize promiscuous and broadcast modes of the ad hoc channel. As a result, our protocol effectively helps to free resources in the cellular network and accelerates the content download for its users. Furthermore, it enables users to continuously obtain data via ad hoc connections during cellular handoff periods and provides multi-homing downloads for groups spanning adjacent cells. We evaluate the performance of iShare by means of simulations and compare it to other content dissemination schemes using cellular broadcast channels, cellular unicast channels, and tree-based protocols. The obtained results show that iShare significantly outperforms alternative approaches and creates a win-win situation by improving performance of both iShare and other mobile users.

show abstract

Section: Mesh Structure Formation and Data Exchangementioning

confidence: 99%

Section: Mesh Structure Formation and Data Exchangementioning

confidence: 99%

Section: Related Workmentioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%

See 2 more Smart Citations

iShare: Exploiting opportunistic ad hoc connections for improving data download of cellular users

Nahrstedt

Rimac³

et al. 2010

2010 IEEE Globecom Workshops

View full text Add to dashboard Cite

show abstract

“…Tree-based routing, however, has a tendency to forward query traffic to the links close to the root of the tree, and cause congestion on those links. Aly and Elnahas [37] proposed a hybrid method; their approach is closer to hierarchical approach than peer-to-peer approach (similar to the first generation P2P services, e.g., Napster).…”

Section: Introductionmentioning

confidence: 99%

Efficient Peer-to-Peer Lookup in Multi-hop Wireless Networks

Shin¹

2009

TIIS

View full text Add to dashboard Cite

In recent years the popularity of multi-hop wireless networks has been growing. Its flexible topology and abundant routing path enables many types of applications. However, the lack of a centralized controller often makes it difficult to design a reliable service in multi-hop wireless networks. While packet routing has been the center of attention for decades, recent research focuses on data discovery such as file sharing in multi-hop wireless networks. Although there are many peer-to-peer lookup (P2P-lookup) schemes for wired networks, they have inherent limitations for multi-hop wireless networks. First, a wired P2P-lookup builds a search structure on the overlay network and disregards the underlying topology. Second, the performance guarantee often relies on specific topology models such as random graphs, which do not apply to multi-hop wireless networks. Past studies on wireless P2P-lookup either combined existing solutions with known routing algorithms or proposed tree-based routing, which is prone to traffic congestion. In this paper, we present two wireless P2P-lookup schemes that strictly build a topology-dependent structure. We first propose the Ring Interval Graph Search (RIGS) that constructs a DHT only through direct connections between the nodes. We then propose the ValleyWalk, a loosely-structured scheme that requires simple local hints for query routing. Packet-level simulations showed that RIGS can find the target with near-shortest search length and ValleyWalk can find the target with near-shortest search length when there is at least 5% object replication. We also provide an analytic bound on the search length of ValleyWalk.

show abstract

Profile-Based Sustained Service Lookup in Areas of Sudden Dense Population

Aly

El-Nahas

2007

21st International Conference on Advanced Information Networking and Applications Workshops (AINAW'07)

Self Cite

View full text Add to dashboard Cite

This paper addresses some of the challenges associated with providing location-based services to mobile users in areas of sudden density increases. We adopt a profilebased peer to peer mode that allows host queries, upon density increase, to obtain their data from built in logical entities within our system called autonomous systems. Autonomous systems are a composite of elite mobile devices selected upon the occurrence of sudden density to cache service data. This work expands on a previously published work by us that demonstrated how sudden densities are detected, how autonomous systems are selected and formed, and how data is cached. In this paper, autonomous systems formation, distribution, and record caching are made highly sensitive to individual users profiles. Simulation and experimental results demonstrate that this approach decreased the latency associated with service lookups as well as increasing the ability to accommodate more mobile users at times of disrupted services.

show abstract

Sustained service lookup in areas of sudden dense population

Cited by 5 publications

References 16 publications

iShare: Exploiting opportunistic ad hoc connections for improving data download of cellular users

iShare: Exploiting opportunistic ad hoc connections for improving data download of cellular users

Efficient Peer-to-Peer Lookup in Multi-hop Wireless Networks

Profile-Based Sustained Service Lookup in Areas of Sudden Dense Population

Contact Info

Product

Resources

About