NDLI: Capacity of composite networks: Combining social and wireless ad hoc networks

Content Provider	IEEE Xplore Digital Library
Author	Azimdoost, B. Sadjadpour, H.R. Garcia-Luna-Aceves, J.J.
Copyright Year	2011
Description	Author affiliation: Department of Electrical Engineering, University of California, Santa Cruz 95064 (Azimdoost, B.; Sadjadpour, H.R.) \|\| Department of Computer Engineering, University of California, Santa Cruz 95064 (Garcia-Luna-Aceves, J.J.)
Abstract	We define composite networks when nodes communicate only with their long-range social contacts and there is no direct link between a node and its long-range contact. Each node has a single long-range contact and all nodes within its transmission range are local contacts for the node. The long-range contact is the destination for each node in the network and since there is no direct link from source to its destination, nodes communicate using multi-hop communications. This is an extension of the famous work by Kleinberg [3] to random wireless ad hoc networks. The throughput capacity of such networks is studied. The routing is based on each node sending the packets to one of its local contacts until the packets reach the destination. The long-range contact distance from a source follows power law distribution with parameter a which is a characteristic of social networks. A tight bound of throughput capacity for different values of a is derived. The results demonstrate that when a increases or equivalently the distance between source and destination decreases, the throughput capacity increases. For a > 3, throughput capacity of 0(1/ log n) is achieved by utilizing simple point-to-point communications where n is the total number of nodes in the network. This is the maximum feasible throughput that can be achieved in point-to-point communications. The result demonstrates the effect of social groups on wireless ad hoc networks. A new parameter called degradation factor is defined which illustrates the asymptotic behavior of networks for large values of $n^{1}.$
Starting Page	464
Ending Page	468
File Size	505467
Page Count	5
File Format	PDF
ISBN	9781612842554
ISSN	15253511
e-ISBN	9781612842547
DOI	10.1109/WCNC.2011.5779177
Language	English
Publisher	Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Publisher Date	2011-03-28
Publisher Place	Mexico
Access Restriction	Subscribed
Rights Holder	Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Subject Keyword	Throughput Social network services Degradation Mobile ad hoc networks Wireless networks Upper bound
Content Type	Text
Resource Type	Article

Sl.	Authority	Responsibilities	Communication Details
1	Ministry of Education (GoI), Department of Higher Education	Sanctioning Authority	https://www.education.gov.in/ict-initiatives
2	Indian Institute of Technology Kharagpur	Host Institute of the Project: The host institute of the project is responsible for providing infrastructure support and hosting the project	https://www.iitkgp.ac.in
3	National Digital Library of India Office, Indian Institute of Technology Kharagpur	The administrative and infrastructural headquarters of the project	Dr. B. Sutradhar bsutra@ndl.gov.in
4	Project PI / Joint PI	Principal Investigator and Joint Principal Investigators of the project	Dr. B. Sutradhar bsutra@ndl.gov.in Prof. Saswat Chakrabarti will be added soon
5	Website/Portal (Helpdesk)	Queries regarding NDLI and its services	support@ndl.gov.in
6	Contents and Copyright Issues	Queries related to content curation and copyright issues	content@ndl.gov.in
7	National Digital Library of India Club (NDLI Club)	Queries related to NDLI Club formation, support, user awareness program, seminar/symposium, collaboration, social media, promotion, and outreach	clubsupport@ndl.gov.in
8	Digital Preservation Centre (DPC)	Assistance with digitizing and archiving copyright-free printed books	dpc@ndl.gov.in
9	IDR Setup or Support	Queries related to establishment and support of Institutional Digital Repository (IDR) and IDR workshops	idr@ndl.gov.in

On the multicast capacity of wireless ad hoc networks with network coding

A simple upper bound on random access transport capacity

On the throughput capacity of wireless Ad-Hoc networks at 60 GHz

Impact of multi-packet transmission and reception on the throughput capacity of wireless ad hoc networks

Lower and Upper Bounds for Throughput Capacity of a Cognitive Ad Hoc Network Overlaid on a Cellular Network

Multicast Capacity of Wireless Ad Hoc Networks with Hierarchical Routing

Capacity of composite networks: combining social and wireless ad hoc networks.

Multicast ad hoc ntworks: A constructive lower bound on throughput capacity

Capacity of wireless ad-hoc networks under ultra wide band with power constraint

Capacity of composite networks: Combining social and wireless ad hoc networks

Similar Documents

On the multicast capacity of wireless ad hoc networks with network coding

A simple upper bound on random access transport capacity

On the throughput capacity of wireless Ad-Hoc networks at 60 GHz

Impact of multi-packet transmission and reception on the throughput capacity of wireless ad hoc networks

Lower and Upper Bounds for Throughput Capacity of a Cognitive Ad Hoc Network Overlaid on a Cellular Network

Multicast Capacity of Wireless Ad Hoc Networks with Hierarchical Routing

Capacity of composite networks: combining social and wireless ad hoc networks.

Multicast ad hoc ntworks: A constructive lower bound on throughput capacity

Capacity of wireless ad-hoc networks under ultra wide band with power constraint

Capacity of composite networks: Combining social and wireless ad hoc networks