The Spatial Capacity of a Slotted ALOHA Multihop Packet Radio Network with Capture

Nelson, Randolph; Kleinrock, Leonard

doi:10.1109/tcom.1984.1096124

Cited by 173 publications

(96 citation statements)

References 8 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…The expected total waiting time (ET W t ) required for all the data packets to reach the T arget region [17] is given in equation (13). h is minimum number of hops, T ps is processing time and E N is time spent by nodes after receiving overall data packets, and the time within which LW nodes are expected to get a new neighbor (equation (11)) for given N , A, d t and r. h = D r , where D is distance between center of T arget region and center of Data region and r is range of mobile node.…”

Section: A Expected Waiting Time To Get a Neighbor Node Under Lw Mobmentioning

confidence: 99%

“…h is minimum number of hops, T ps is processing time and E N is time spent by nodes after receiving overall data packets, and the time within which LW nodes are expected to get a new neighbor (equation (11)) for given N , A, d t and r. h = D r , where D is distance between center of T arget region and center of Data region and r is range of mobile node. From equation (13), when E N is minimum say E N ≈ 0, minimum end-to-end waiting time (T W t min ) bound for users to receive data is obtained from equation (14).…”

Section: A Expected Waiting Time To Get a Neighbor Node Under Lw Mobmentioning

confidence: 99%

“…We propose a simple data forwarding protocol based on data transmission time and human walk velocity called DTT-HWV. We compare proposed data forwarding protocol with random progress (RP) [12], [13] data forwarding method, where data sending node selects randomly one of its neighbor node which is having forward progress and overcomes the trade off between progress and transmission success. The simulation results shows that DTT-HWV performs better than RP data forwarding method in terms of end-to-end waiting time to receive data in OMPSN.…”

Section: Introductionmentioning

confidence: 99%

See 2 more Smart Citations

Levy walk based multi-hop data forwarding protocol for Opportunistic Mobile Phone Sensor Networks

Thejaswini¹,

Rajalakshmi

Desai

2013

2013 9th International Conference on Information, Communications &Amp; Signal Processing

View full text Add to dashboard Cite

Abstract-Unstable link connectivity due to dynamic mobility nature of mobile phone users and error prone wireless link quality increases end-to-end delay for mobile phone based opportunistic network applications. This problem becomes more worse in the presence of large amount of data transmission, like multimedia data. This paper refers to Levy walk based multihop data forwarding protocol called Data Transmission Time and Human Walk Velocity (DTT-HWV) for Opportunistic Mobile Phone Sensor Networks (OMPSN). This paper, in particular evaluates the performance of proposed protocol in terms of endto-end waiting time to receive data, which is an important QoS requirement for data transmission in opportunistic networks. The proposed protocol DTT-HWV reduces end-to-end waiting time to receive data compared to Random Progress (RP) data forwarding method in presence of low battery power and high path loss. Obtained results are helpful in designing and building of large scale data retrieval services for opportunistic networks involving humans in the communication network loop.

show abstract

Section: A Expected Waiting Time To Get a Neighbor Node Under Lw Mobmentioning

confidence: 99%

Section: A Expected Waiting Time To Get a Neighbor Node Under Lw Mobmentioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%

See 1 more Smart Citation

Levy walk based multi-hop data forwarding protocol for Opportunistic Mobile Phone Sensor Networks

Thejaswini¹,

Rajalakshmi

Desai

2013

2013 9th International Conference on Information, Communications &Amp; Signal Processing

View full text Add to dashboard Cite

show abstract

“…Each node routes a packet to the neighbor in its cell that is the nearest to the receiver. Several strategies can be adopted to select the next hop [13], [14], [15], [16]. In fig.1(a), an example of GREEDY forwarding is shown, taken from [17].…”

Section: Related Workmentioning

confidence: 99%

Spatial and Traffic-Aware Routing (STAR) for Vehicular Systems

Giudici

Pagani

2005

High Performance Computing and Communications

View full text Add to dashboard Cite

Abstract-Vehicular ad hoc networks are studied with increasing interest for the many possible applications they have. Equipping vehicles with wireless devices primarily allows to design protocols and mechanisms to improve street safety. But also distributed applications for cooperative work, fleet management, passengers entertainment, could be supported. However, novel network protocols must be designed to make the deployment of vehicular networks possible.In this paper we consider the problem of data routing. We propose a novel position-based routing algorithm that is able to exploit both street topology information achieved from geographic information systems and information about spatial distribution of vehicles along street and vehicular traffic, in order to perform accurate routing decisions. The algorithm has been implemented in the NS-2 simulation environment and its performance has been compared with three other algorithms proposed in the literature.

show abstract

“…Moreover, if Z is the r.v. governing the projected advancement toward the sink, its pdf conditioned on r is given by [17]:…”

Section: Characterization Of Optimal Advancementsmentioning

confidence: 99%

Cost Efficient Localized Geographical Forwarding Strategies For Wireless Sensor Networks

Rossi

Zorzi

Distributed Cooperative Laboratories: Networking, Instrumentation, and Measurements

View full text Add to dashboard Cite

Abstract. In this paper we investigate the relationship between local next hop selection strategies and their efficiency in terms of both link related metrics, such as the mean packet delivery fraction, and network related metrics, such as the energy status of the node elected as relay. In standard geographical forwarding algorithms the relay selection is usually carried out by means of advancements toward the destination. However, channel attenuation phenomena often make pure geographical strategies ineffective as the quality of a transmission link is not necessarily deterministically related to the node coordinates. In order to achieve effective and cost efficient routing solutions, it is therefore crucial to couple advancements toward the destination with link quality aspects as well as network related metrics (e.g., node energies). This study is a preliminary step toward the design of local relay selection rules which jointly account for these aspects and whose aim is to cut the desired trade-off between delay and cost efficiency.

show abstract

The Spatial Capacity of a Slotted ALOHA Multihop Packet Radio Network with Capture

Cited by 173 publications

References 8 publications

Levy walk based multi-hop data forwarding protocol for Opportunistic Mobile Phone Sensor Networks

Levy walk based multi-hop data forwarding protocol for Opportunistic Mobile Phone Sensor Networks

Spatial and Traffic-Aware Routing (STAR) for Vehicular Systems

Cost Efficient Localized Geographical Forwarding Strategies For Wireless Sensor Networks

Contact Info

Product

Resources

About