Efficient Data Query in Intermittently-Connected Mobile Ad Hoc Social Networks

Liu, Yang; Han, Yanyan; Yang, Zhipeng; Wu, Hongyi

doi:10.1109/tpds.2014.2320922

Cited by 40 publications

(20 citation statements)

References 42 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Liu et al 4 focused on the efficient data query in Intermittently Connected Mobile Ad Hoc Social Networks. A disadvantage of ant colony algorithm has been presented in Dominguez and Cruz-Corte´s.…”

Section: Related Workmentioning

confidence: 99%

Energy optimization of ant colony algorithm in wireless sensor network

Nie

Qiu

et al. 2017

International Journal of Distributed Sensor Networks

View full text Add to dashboard Cite

An energy consumption optimization algorithm based on ant colony algorithm is proposed for wireless sensor network. The proposed algorithm allows each node in wireless sensor network to save the distance and residual energy of neighbor nodes. Furthermore, in terms of probability selection of the nodes and the pheromone update, this algorithm focuses on the next hop node through the comparison of distance between the nodes and the residual energy, which ensures less possibility of nodes with low energy selected as the next hop. Therefore, the proposed algorithm improves energy load balancing, stability of wireless sensor network and, eventually, extends the life span of the wireless sensor network. The simulation results show that the improved ant colony algorithm avoids too much energy consumption of a certain local node resulting in more uniform energy consumption for each node.

show abstract

Section: Related Workmentioning

confidence: 99%

Energy optimization of ant colony algorithm in wireless sensor network

Nie

Qiu

et al. 2017

International Journal of Distributed Sensor Networks

View full text Add to dashboard Cite

show abstract

“…We can classify search schemes as content-oblivious [1,10,13,14] and content-aware [2,3,7,12] based on their consideration of content characteristics in tuning the search parameters (Table 1). Generally speaking, content-oblivious schemes do not adapt the search strategy according to the requested content, but focus on routing and hitting the content by ensuring good coverage of the potential content providers.…”

Section: Related Workmentioning

confidence: 99%

“…The hurdles of lack of awareness in opportunistic networks are mitigated by redundancy, that is, opportunistic protocols replicate messages and route them in parallel rather than routing a single copy and retransmitting it in case of failures. Some schemes introduce a limited number of replicas at the time of query generation and increase redundancy on the fly at each node [12], whereas some flood the query first and later reduce redundancy by terminating the queries [13,14]. A query may reach a provider but have very little time before expiry for content delivery.…”

Section: Related Workmentioning

confidence: 99%

“…The forwarding decision may also consider the distance from the searching node's estimated location to avoid spreading queries with little chance of reaching the searching node [14]. Content-aware schemes [2,3,12] guide the search based on local knowledge about the searched content, for example, its availability, mapping between content and geolocation, or people's interests. As the content with higher availability is located on average closer to the searching node, a query can be limited to the expected distance from a content provider, or each node can decide on terminating the query and sending a response based on the observed availability [2].…”

Section: Related Workmentioning

confidence: 99%

See 1 more Smart Citation

Search in digital pockets: retrieving remote content in mobile opportunistic networks

Bayhan

Hyytiä

Kangasharju

et al. 2016

IEEE Wireless Commun.

View full text Add to dashboard Cite

Due to the fierce competition for the wireless spectrum, operators have recently focused on short-range communications, which promises higher spectral efficiency, lower energy consumption, and less strain on the operators' core networks. Mobile opportunistic communications, that is, short-range communications without any network assistance, is of considerable practical value since it entails almost no monetary cost and does not rely on any infrastructure. Compared to the extensive work on opportunistic networks, the predominance of video and other content calls for new content-centric approaches. To this end, the motivation of this article is to explain how opportunistic search can discover the content stored in remote mobile devices and deliver it to the requesting node. We abstract the problem domain as three layers, network topology, content, and query; and describe the interactions among these components. After reviewing each layer, we introduce several schemes for content availability estimation that do not rely on any information exchange but simply use already available information. Additionally, we highlight some open research directions.

show abstract

“…The proposed distributed mobile HIP proxy (DMHP) enables host mobility in a flat network architecture and addresses problems of handover delay, scalability, single point of failure, packet loss, and signaling overhead. Further enhancement can be added to our proposal, DMHP, by (1) using an optimization model to provide useful theoretical insights and a protocol of distributed data query such as one presented in [5] and (2) using a distributed online algorithm that employs an optimal stopping theory to let nodes make adaptive, online decisions on whether this communication opportunity should be exploited to deliver data packets in each meeting event as explained in [6]. Although the method in [5] is developed to efficiently allow data query in a Mobile Ad hoc Social Network (MASON), many of its ideas can be employed by DMHP, i.e., designed for infrastructure networks without centralized host mobility support, that may lead to further improvement.…”

Section: Introductionmentioning

confidence: 99%

Distributed mobility management with mobile Host Identity Protocol proxy

Muslam

Chan

Ventura

2017

J Wireless Com Network

View full text Add to dashboard Cite

The architectural evolution from hierarchical to flatter networks creates new challenges such as single points of failure and bottlenecks, non-optimal routing paths, scalability problems, and long handover delays. The cellular networks have been hierarchical so that they are largely built on centralized functions based on which their handover mechanisms have been built. They need to be redesigned and/or carefully optimized. The mobility extension to Host Identity Protocol (HIP) proxy, mobile HIP Proxy (MHP), provides a seamless and secure handover for the Mobile Host in the hierarchical network. However, the MHP cannot ensure the same handover performance in flatter network because the MHP has also utilized the features offered by the hierarchical architecture. This paper extends the MHP to distributed mobile HIP proxy (DMHP). The performance evaluation of the DMHP in comparison to MHP and other similar mobility solutions demonstrates that DMHP does indeed perform well in the flatter networks. Moreover, the DMHP supports both efficient multi-homing and handover management for many mobile hosts at the same time to the same new point of attachment.

show abstract

Efficient Data Query in Intermittently-Connected Mobile Ad Hoc Social Networks

Cited by 40 publications

References 42 publications

Energy optimization of ant colony algorithm in wireless sensor network

Energy optimization of ant colony algorithm in wireless sensor network

Search in digital pockets: retrieving remote content in mobile opportunistic networks

Distributed mobility management with mobile Host Identity Protocol proxy

Contact Info

Product

Resources

About