Open Access

Mobile user-preference-based data dissemination on mobile P2P networks

EURASIP Journal on Wireless Communications and Networking20112011:118

https://doi.org/10.1186/1687-1499-2011-118

Received: 4 April 2011

Accepted: 4 October 2011

Published: 4 October 2011

Abstract

A considerable number of studies have been performed recently on mobile peer-to-peer networks (MOPNETs), as the number of services based on mobile devices has increased. However, existing studies still reveal numerous shortcomings, such as bandwidth overhead, and redundant transmission in terms of multi-broadcast between peers. Especially, owing to the characteristics of MOPNETs, it is extremely important to determine broadcast size and to disseminate data within the limited environment of the network. The mechanism directly affects how well resource information in a mobile device is discovered and how data are transmitted. In this context, it is vital to efficiently disseminate data to be able to arrange hierarchal sequences of resource information of each mobile device for better search performance. Especially, it is also vital to determine the broadcast size, considering the consumption patterns of mobile users. In this article, we propose an adaptable algorithm that determines weighted values and disseminates data using the high-order Markov chain (HoMC). We apply weighted values in consideration of the MOPNET environment. In addition, the proposed HoMC-based Mobile User-preference-based Data Dissemination algorithm was simulated with a Qualnet simulator. Results show that the proposed algorithm performs 17.3% better, on average, in terms of data dissemination, than the existing dissemination methods.

Keywords

rank-based broadcast high-order Markov Chain mobile P2P networks Qualnet

1. Introduction

Mobile peer-to-peer network (MOPNET) [1] is an emerging infrastructure designed to facilitate information sharing among mobile devices. It has been adopted for diverse purposes, such as social networks, transportation, mobile electronic commerce, emergency response [2], and homeland security [3]. Data dissemination is an essential component for publication of or subscription to the resource information among dynamic mobile users on a MOPNET, since resource discovery is a main issue of MOPNET [4, 5]. However, many communication problems have been reported in the MOPNET environment, including non-adaptiveness, implosiveness, query overlaps, resource blindness, and communication overhead. In addition, transmission of unnecessary data in a limited network environment often leads to loss of a mobile system's power capacity and bandwidth, and delay and loss of packets. Hence, it is necessary to decide an efficient algorithm of data dissemination for resource discovery, and disseminate data in a stable and timely fashion. Especially, dissemination of the rank-based broadcast (RBB) [6, 7] is performed, only after the ranks (i.e., priority of broadcast) and the broadcast sizes are determined for queries and resource information (i.e., reports) occurring on a MOPNET. However, knowing the number of queries and reports being called is insufficient for exact broadcasting. Therefore, determination of exact broadcast size becomes possible through analysis of a mobile user's queries and reports to overcome limitations lingering in the traditional RBB. The new approach also secures high accuracy and matched throughput in dissemination. This study proposes an adaptive method in consideration of an account user's preferences that are tallied, based on the frequency of user query requests during data dissemination. It reduces unnecessary transmission by sharing the resources that are most frequently requested by users. It contrasts with traditional methods, such as the RBB. In this respect, our proposed mechanism facilitates efficient sharing and transmission of low bandwidth and limited content seeds in a limited network environment, or the MOPNET. A mobile user-preference-based data dissemination (MUDD) method has been proposed in this article, based on the high-order Markov chain (HoMC) [8, 9]. Hardware characteristics limit the number of content items available on a MOPNET for each mobile user's communication purposes. Thus, application of the HoMC, which facilitates learning with a limited number of data, improves the accuracy and the volume of data processing. Moreover, it is further intended to optimize our proposed algorithm with weighted values to maximize query hit rates.

The remainder of this article is organized as follows: Section 2 describes the related work for data dissemination methods, such as traditional flooding-based method, gossiping method and RBB; Section 3 explains the proposed technique, which is a MUDD using HoMC; a Qualnet, (a network simulator)-based simulation result is described in Section 4; and Section 5 concludes this article and suggests future research.

2. Related work

Various researches have been proposed in the limited wireless network environment to operate the data dissemination task efficiently.

Chatzigiannakis et al. [10] proposed a new data dissemination protocol for wireless sensor networks, which pulls additional knowledge about the network to subsequently improve data forwarding toward the sink. This extra information is still local, limited, and obtained in a distributed manner. This extra knowledge is acquired by only a small fraction of sensors. Thus, the extra energy cost only marginally affects the overall protocol efficiency. The protocol has low latency and manages to propagate data successfully, even in the case of low densities. However, the proposed mechanism has a limitation in that it does not support adaptive data dissemination, because it does not reflect the real network condition. In contrast, our proposed model makes a feature of adaptive data dissemination based on self-adjusting the various parameters in terms of the actual network conditions.

Prasad Sistla et al. [11] examined the dissemination of availability reports on resources in MOPNETs, where moving objects communicate with each other via short-range wireless transmission. Each disseminated report represents an observed spatial-temporal event, and the relevance of the report to a moving object decays, as the age of the reported resource and the distance from its location increase. In addition, they proposed an opportunistic approach, in which an object propagates the reports it carries (namely, the information that it has about these resources) to objects encountered and obtains new reports in exchange. Least relevant reports are discarded after each exchange to limit the communication data volume of future exchanges. Their theoretical and experimental analysis indicates that the opportunistic dissemination algorithm automatically limits the global distribution of a report to a bounded spatial area and to the duration for which it is of interest. To some extent, our solution is similar to the Opportunistic Resource Exchange model, but we use a different propagation manner, a user-preference training-based probability model because of different application requirements. That is, it is important to broadcast the packet to other nodes more precisely in a limited network environment.

Li et al. [12] presented an Efficient Multi-Source data dissemination scheme (EMS), efficient multi-source data dissemination in P2P networks. Nodes are organized in a two-layer structure by leveraging node heterogeneity: the upper layer is based on the DHT protocol and composed of powerful and stable nodes, while the nodes at the lower layer attach to physically close upper layer nodes. Data objects are replicated and forwarded along implicit trees, based on the DHT route table. The average path length for delivering objects to all nodes converges to O(log n) automatically, where n is the number of nodes in the application. However, this approach has to evaluate the performance with different capacity profiles. In contrast, this article presents a comparative analysis of the proposed model and existing algorithms. In general, several methods have been devised to disseminate data. Flooding-based method [13, 14], gossiping-based method [15, 16], and the RBB [6, 7] are typical examples.

A flooding-based method emits queries and reports on the content list to randomly chosen targets over the network. The method serves as a foundation for the other advanced methods. The method, however, fails to overcome several inherent problems, such as data implosion, query overlaps, and resource blindness. A gossiping-based method was proposed to reduce the frequency of the implosion and the system overhead. Reports are transmitted to the randomly selected targets that are concerned with a particular content under the new approach. However, some mobile users on a large network may not receive the message at all, since a neighbor is selected randomly. Thus, the gossiping method does not provide a reliable method of data dissemination.

Yet another new method, termed as the RBB algorithm, was conceived to solve these problems. The algorithm ranks reports for the purpose of discovering local spatial-temporal resources in highly mobile environments. Under RBB, the relevant functions are employed in consideration of prioritized reports to downsize the broadcast. Reports are ranked, based on their relevancy to queries received from other mobile users. Only top-ranked reports (k-1) are sent in each broadcast round; namely, reports are ranked to prevent the overhead of existing flooding methods and to reduce redundancy of data dissemination. However, high communication overhead of a RBB with large resources degrades its search performance. The RBB algorithm is not efficient, though, since every mobile user calculates the expectation value to determine ranks, a process that is not always necessary. Thus, a need arises for a more efficient algorithm to reduce the overheads from communication and unnecessary computation.

It is necessary to consider not all, but only the mobile users related to user preferences and their affected mobile users to achieve a heightened efficiency. Table 1 compares studies on data dissemination methods in terms of pros and cons.
Table 1

Comparison of studies on data dissemination methods

 

Approach

Advantage

Disadvantage

Flooding-based method [14, 15]

This ensures the data and queries for data are sent all over the network

Simple and classical method

data implosion, query overlaps, and resource blindness

Gossiping-based [16, 17]

Mobile users receiving the packet forward it only to a single randomly selected neighbor, instead of sending it to all neighbors.

It avoids the problem of implosion and it does not waste as much network resources as flooding does.

Some mobile users in the large network may not receive the message, since the neighbor is selected randomly.

RBB [6, 7]

RBB algorithm ranks reports to discover local spatial-temporal resources in highly mobile environments.

To prevent overhead of existing flooding methods, to reduce redundancy of data dissemination

high communication overhead, unnecessary computation

Our proposed model

Mobile User-preference-based Data Dissemination method

Data dissemination of high accuracy, high data throughput, low computation

Size of training matrix

3. Mobile User-preference-based Data Dissemination (MUDD) on a MOPNET

The aim of data dissemination with preference of mobile user means an efficient information resource sharing in a limited network environment, such as MOPNET. In addition, an advantage of this approach is its support of a personalization service. Especially, searching for the data of interest through queries should be efficient to share in the continuous information resource between mobile users. Thus, analysis of an account of mobile user's preferences is required for efficient information resource. Accordingly, the proposed model in this study analyzes user's preference using HoMC to decide the broadcast size and then to disseminate data to other nodes.

We define to help understand terms in our proposed model more clearly. Rank refers to the matching sum of queries received by each mobile user and retained resource information. The query list refers to the sum of queries retained by all users on a MOPNET. In addition, report denotes the content list to which the rank values retained by each mobile user are applied. The term preference refers to the resulting value(s) from the analysis of a user's content-consuming patterns through the HoMC function at the rate of matching a mobile user's reports with the number of queries from other users.

Figure 1 illustrates how each mobile user communicates with each other for the user's preference-based broadcast on a MOPNET. When the new mobile user (a) enters a MOPNET environment, the new mobile user retains the native query and the broadcast size (k-1) on her or his report list, and broadcasts the modified report list to all users. Other mobile users (b) analyze their own preferences with the received report list and the native query from the new inserted mobile user. Further, each user (c) computes and updates ranks of each report with the analytic results. Then, all users rebroadcast their own query to other users, along with the modified report list. Once user preferences are trained, the broadcast algorithm becomes more efficient, since users tend to request most-frequently-used queries repeatedly, especially, in certain domains, such as social networks and transportation for commuters. Accuracy in data dissemination gradually increases, as time passes, with the help of the effective training algorithm.
Figure 1

MUDD on a MOPNET illustrates how each mobile user communicates with each other for the user's preference based broadcast on a MOPNET.

3.1 Overview of MUDD

Figure 2 illustrates the pseudocode of how the user-preference-aware broadcast algorithm works.
Figure 2

Pseudocode for MUDD on a MOPNET illustrates the pseudocode of how the user-preference aware broadcast algorithm works.

In the initial stage, the n number of mobiles users exchange and store their query lists and report lists to form a MOPNET.
  1. 1.

    A mobile user broadcasts to other users the k-1 number of report lists and one query of her or his interest in the course of session formation on a MOPNET. (L5)

     
  2. 2.

    Each mobile user checks the received query and the k-1 number of reports against her or his own report lists to detect overlap. (L6)

     
  3. 3.

    Once detected, each user updates her or his report lists by analyzing her or his preferences through the HoMC algorithm. Simultaneously, the information on each user's preferences is updated. (L7 ˜ L8)

     
  4. 4.

    When overlapping is not found among the lists, the preference information is updated as such, without any further modification. (L11 ˜ L13)

     
  5. 5.

    Each mobile user broadcasts queries of her or his interest and report lists to other users. (L14)

     

Otherwise, it computes ranks, based on user preference, and registers the relevant information. To which and how many target mobile users the reports are to be re-broadcast is determined when queries and reports are sent with the broadcast size "k-1". The process will be detailed in the following subsections.

3.2 MUDD process

Each mobile user receives queries from the sensors of the other mobile users to disseminate the queries through broadcast. If the received queries exist on the list of the mobile user, then the queries and their related reports are re-ranked. Otherwise, the information on the queries and the reports is updated to the mobile user O's list. The duplicates are checked for each received query, and only the copy with the smallest rank is kept. That is, this process attempts to significantly reduce duplicated transmissions by disseminating only new data to old neighbors, or only old data to new neighbors.

3.2.1 Computation of rank

Equation (1) defines the report as the sum of all relevance values to rank a mobile user's preference. Foreign queries, or the queries of the other mobile user O, are received from other mobile users, and these foreign queries constitute non-native queries. Let (Q1, Q2, ......,Q n ) be the queries related to a mobile user O. The following expression defines the report of each mobile user at the time t (i.e., a(R P )) in consideration of the ranks of mobile user preferences:
R a n k ( a ( R P ) ) = i = 1 n m a t c h ( a ( R P ) , Q i )
(1)

The relevance of a report "a(R P )" to a query "Q" is determinable, if Q(a(R P )) = true and match(a(R), Q) = 1. Otherwise, Q(a(R P )) = false and match(a(R P )), Q = 0. That is, the process denotes the meaning of "match" in equation (1). Finally, the mobile user (Q1) sequentially prepares reports on the query and report list, and broadcasts queries and reports on the information required to be shared on the query and report list.

3.2.2 Training of mobile user's preference

We have designed the function P and computed mobile user preferences in a HoMC, as shown in equation (2), to train user-preference ranks through the HoMC:
P = ( ( X ( t + 1 ) = x j | X ( t ) = x i , X ( t - 1 ) ) = x k , . . . . . . , X ( t - r + 1 ) = x m ) = ( n x j / i = 1 c n x j )
(2)

where, x: the number of objects, r: an order of Markov, n x : the number of received queries, and X: an eigen function about user-preference with time

Equation (2) assumes the r- th ordered Markov model. Thus, the assumption leads to the conclusion that the condition probability at the point of t+1 is obtainable through an expression X (t+1) = x j , if the r- th state transition has occurred previously.

3.2.3 Decision of broadcast size

In addition, the size of the mobile user-preference probability is determined, which is the upper bound, to compute a broadcast size "k" as depicted in equation (3).
k = P × 1 0 0
(3)

That is, the result of the "k" function is incorporated in the average receipt rate of queries (i.e.,. a random variable).

3.2.4 Expectation of broadcast size

When the reports on the interested topics are prepared from the query and report list, equation (4) is used to determine the expectation values for pairing with queries. An expectation value, in turn, denotes how to more correctly match the reports information in the sending mobile user and the queries in the receiving mobile user. In addition, it is adaptable to the size of the time duration, since the last broadcast of a mobile user, O. That is, the expected value 'E(X )' [7] of a random variable for the broadcast size "k" on the list is determined based on this idea, as depicted in equation (4):
2 π λ k 0 e δ ( 1 - p ) λ e 2 ( 2 q ( δ 2 e ) + ( π - 2 q ( δ 2 e ) ) × ( 2 T + 1 ) ) E ( x ) 2 π λ k 0 e δ ( 1 - p ) λ e 2 ( 2 q ( δ 2 e ) + ( π - 2 q ( δ 2 e ) ) × ( 2 T + 1 ) ) - 1 d δ
(4)
where parameters of symbols are defined as shown in Table 2, to compute the expected values in equation (4). Thus, a mobile user broadcasts, to other mobile users, the reports on a native query of a broadcast size k. If the size k is used to determine the broadcast size, it is possible to reduce unnecessary broadcasts between users, and to dynamically apply it to them.
Table 2

Symbol definition for expectation value

Symbol

Description

λ

Number of moving objects per unit in the MOPNET field

e

Transmission range of each moving object in meters

k

Number of reports (i.e. broadcast size)

p

The probability that a moving object attempts to start a broadcast

p '

The probability that a moving object starts per second

T

The volume of transmitted packets per second

3.2.5 Parameter optimization for HoMC

The accuracy of our model was compared for each of the parameter values (ρ,r, k) to estimate optimal parameters of the HoMC-based RBB, as shown in Figure 3. In detail, ρ is the scaling factor optimal value of which is computed, based on the empirical tests shown later. Moreover, r represents the degree of a HoMC, and k represents the continuation weighted-parameter "w" between the d-k and the d hour. These optimal parameters are derived from equation (5), as follows:
Figure 3

Optimal parameter sets show the result of a HoMC-based MUDD with weighted values, when ρ > 1 and k > 1.

w d - 1 , d j ( t + 1 ) = ρ ( 1 + τ d , d - 1 j ( t + 1 ) ) = i = 1 k w d - 1 , d j ( t + 1 )
(5)

where τ: number of recommendation report

Accordingly, accuracy (ϕ) is computed as depicted in equation (6):
ϕ = ω τ ω × 1 0 0 , w h e r e ω : n u m b e r o f m o b i l e u s e r s i n t e r e s t p a c k e t
(6)

In the first-order Markov chain, the parameter values are ρ = 1, r = 1, and k = 0, and the mean accuracy is 33%. In addition, when the parameter values are ρ = 1, r = 2, and k = 0, the second-order Markov chain shows an accuracy of 30% on average. Thus, if the order of a Markov chain increases, then the number of combination patterns also increases. Thus, the low coverage is detectable through insufficient training reports. Figure 3 shows the result of a HoMC-based MUDD with weighted values, when ρ > 1 and k > 1. Upon application of optimized parameters, when ρ = 2, r = 1, and k = 2, the accuracy increases and reaches above maximum 68%. Therefore, when a set of optimized parameters, or (2, 1, 2), is selected, our proposed model performs 17.3% better in terms of accuracy than the existing RBB algorithm does. The optimal parameter set is actively formed and used, depending on relevant MOPNET components (e.g., the number of mobile users, the network bandwidth, the device performance, and the signal strength).

4. Simulation Results

4.1 Simulation Environment

The Qualnet simulator [17] is employed to construct the proposed model to simulate efficient data dissemination based on user preference. A P2P network was created on a MOPNET that had one thousand mobile users, as depicted in Figure 4. In particular, at the start of the simulation, 1000 users were randomly positioned over an area of half a square mile. Each user was assigned to a random position within the area. Eight pairs of source and destination users were selected; these users communicated at a constant bit rate. Each source user randomly sent 512-byte packets to destination users during the simulation. The average simulation duration was 25 with 0.1-s, intervals inserted in between.
Figure 4

Qualnet simulation environment A P2P network was created on a MOPNET that had 1000 mobile users.

4.2 Mobile User-preference-based Data Dissemination on a MOPNET

One of the 1000 mobile users was selected randomly. Then, the datasets on the selected mobile user's preferences were collected for six 10-min periods, using the HoMC on a MOPNET. Specifically, as shown in Table 3, the preference datasets of the mobile user are presented as r1, r2,......,r8 through the 8 × 8 transition matrix, which has been designed to train a mobile user's preferences. This assumed that all combination sets of two values c'(r i , r j ) are compared to each other via the 8 × 8 matrix to compute the mobile user's preferences. Then, the combination set with the two highest values was selected. From Table 3, the transition of the stochastic characteristics of the mobile user's tendency inferred along the time line is determined by the equation (7) given below:
Table 3

Preferred calculation from data, using first-order Markov Chain

 

r 1

r 2

r 3

r 4

r 5

r 6

r 7

r 8

r 1

3

0

2

3

1

0

0

0

r 2

4

0

3

3

1

0

0

0

r 3

2

0

3

2

0

0

0

0

r 4

6

0

4

5

0

0

0

0

r 5

0

0

1

1

0

0

0

0

r 6

0

0

0

0

0

1

0

0

r 7

0

0

0

0

0

0

2

0

r 8

0

0

0

0

0

0

0

0

i c n i j ( r 1 , r 4 )

9

0

6

8

1

0

0

0

i c n i j ( r 1 , r 4 ) j = 1 c i c n i j

0.4

0

0.25

0.33

0.04

0

0

0

P ^ ( X ( t + 1 ) = x j | X ( t ) = c ) = j c n i j ( r i , r j ) j = 1 c i c n i j
(7)
Based on the computational results of equation (7), the c' = (r1, r4) was recommended for its two highest values, or r1 (0.4) and r4 (0.33), since other combinations, or (r1, r2), (r1, r3), ......,(r7, r8), were smaller than (r1, r4). Furthermore, Table 4 illustrates how to measure the rank of a report to be broadcast, which has been adjusted by the weight value. Thus, r1(1.4) and r3(1.6) were chosen by α. r3 was selected instead, however, since the weight value of the report (r3) was higher than that of r1 (1.6 > 1.4). Likewise, the above equation continuously computes ranks of the other reports.
Table 4

Preferred calculation, using HoMC with weight values

 

r 1

r 2

r 3

r 4

r 5

r 6

r 7

r 8

α = ω d - 1 , d j ( t + 1 )

1.4

1

1.6

1.3

1.1

1

1

1

β = i c n i j

9

0

6

8

1

0

0

0

γ = i c α n i j

13

0

9.7

8

1

0

0

0

δ = i c n i j j = 1 c i c n i j

0.4

0

0.3

0.2

1

0

0

0

α, weight value of each state; β, total frequency of states; γ, total weight value of each states; δ, preference value.

Figure 5 compares the original RBB algorithm to RBB's values through the HoMC-based MUDD. In the ideal case, once a moving object enters the system, it immediately receives all the reports that have ever been generated in the system, and it instantaneously receives every report that is generated during its lifespan. In this context, our model performs better than the existing RBB algorithm in terms of corresponding match throughput, and proves that it is more adaptable to the time duration and the size of data dissemination through the HoMC-based MUDD optimization. Furthermore, in our model, dissemination and ranking of queries enable a mobile user to broadcast the selected reports in such a way as to maximize bandwidth utilization. Furthermore, when disseminating data in consideration of mobile user's preferences, as shown in Figure 5, the match throughput showed a 19% improvement on average, compared to those under traditional RBBs. Especially, when the number of users reached 500 or more, the processed volume was 30.1% higher on average. The findings indicate that the learning result via the Markov chain is in direct proportion to the number of users. In addition, as shown in Figure 6, this proposed model yields good performance in terms of precision, recall, and accuracy.
Figure 5

Match throughput of MUDD compares the original RBB algorithm to RBB's values through the HoMC-based MUDD.

Figure 6

Sensitive analysis show performance of proposed model in terms of precision, recall and accuracy.

As illustrated in Figure 6, user-preference-based broadcasting produced a 97% true positive and a 96% precision. That is, each mobile user on a MOPNET broadcasts accurate information to each other. Thus, it is fair to say that they are well trained.

5. Conclusions

Existing many researches have tried to solve data dissemination problems, such as loss of a mobile system's power capacity and bandwidth, and delay and loss of packets in terms of data dissemination. In spite of these efforts, there are lots of limitations, such as non-adaptiveness, implosiveness, query overlaps, resource blindness, and communication overhead in the MOPNET environment. In order to overcome these issues, we analyzed mobile user's preferences which mean a user's content-consuming patterns. As a result, we can reduce the implosion impact caused by queries and resource information sent out from mobile users.

This article proposed an adaptive method with an account user's preferences that are tallied, based on the frequency of user query requests during data dissemination. It reduces unnecessary transmission by sharing the resources that are most frequently requested by users. It contrasts with traditional methods, such as the RBB. In this respect, our proposed mechanism facilitates efficient sharing and transmission of low bandwidth and limited content sent in a limited network environment, or the MOPNET. Thus, we proposed a method to discover resources, considering a user's preferences to gain better insight into the performance of a mobile device. Discovery is conducted through the HoMC to build a MOPNET with each user. Then, this model was compared to the original RBB, and then juxtaposed with an ideal case. In addition, this proposed model sets priorities in data dissemination, based on predetermined conditions, such as a user's preferences, and corresponding responses, such as reports. The following results were achieved applying this research: First, it was possible to rank a query report related to a user's preferences and then to create, based on the accuracy of a MOPNET, optimal parameter sets. Second, we implemented a dynamic network with a Qualnet simulator. Thus, the proposed HoMC-based MUDD algorithm was simulated. The results showed that the proposed algorithm performed 17.3% better, on average, in terms of data dissemination, than other existing dissemination methods. Third, we employed a broadcast methodology in our algorithm which was based on prioritized data to overcome resource limitations. It is recommended that future studies investigate various wireless networks, such as IEEE 802.11, 802.15, and 802.16. Furthermore, this proposed model will use optimized algorithms, such as a hidden Markov Model, as the basis for increasing the number of users and queries on a MOPNET.

Declarations

Acknowledgements

This research was partially supported by: the MKE-ITRC (NIPA-2011-C1090-1131-0008), Software Engineering Technologies Development program of NIPA, and the Center of the Seoul Development Institute (WR080951, Establishment of Bell Labs in Seoul/Research of Broadband Convergent Networks and their Enabling Technologies), and the Second Brain Korea 21 Project.

Authors’ Affiliations

(1)
Department of Computer Science and Engineering, Korea University

References

  1. Fitzek FrankHP, Charaf Hassan: Mobile Peer to Peer (P2P): A Tutorial Guide. Wiley; 2009.View ArticleGoogle Scholar
  2. Manoj BS, Baker AH: Emergency response information systems: Emerging trends and technologies. Communications of the ACM 2007, 50(3):29-31. 10.1145/1226736.1226760View ArticleGoogle Scholar
  3. Information Sharing for Homeland Security: A Brief Overview: CRS Report for Congress USA. 2005.Google Scholar
  4. Trunfio P, Talia D, Papadakis H: Peer-to-Peer resource discovery in Grids: Models and systems. Future Generation Computer Systems, Elsevier 2007, 23(7):864-878. 10.1016/j.future.2006.12.003View ArticleGoogle Scholar
  5. Filfe LeslieD, Le Gruenwald : Research Issues for Data Communication in Mobile Ad-Hoc Network Database System. SIGMOD Record 2008, 671-677.Google Scholar
  6. Luo Y, Wolfson O: Mobile P2P Databases. Encyclopedia of GIS 2008, 671-677.View ArticleGoogle Scholar
  7. Wolfson O, Xu Bo, Yin Huabei, Cao Hu: Search-and-Discover in Mobile P2P Network Databases. Distributed Computing Systems 2006, ICDCS 26th IEEE International Conference on 2006.Google Scholar
  8. Ching Wai-Ki, Ng MichaelK: Markov Chains: Models, Algorithms and Application. Springer online 2006, 111-139.Google Scholar
  9. Raftery AdrianE: A model for high-order Markov chains. In Journal of the Royal Statistical Society Edited by: Series B. 1985, (3):528-539.Google Scholar
  10. Chatzigiannakis I, Kinalis Athanasios, Nikoletsea Sotiris: Efficient and Robust Data Dissemination using Limited Extra Network Knowledge. DCOSS 2006, LNCS 4026 2006, 218-233.Google Scholar
  11. Prasad Sistla A, Wolfson Ouri, Xu Bo: Opportunistic Data Dissemination in Mobile Peer-to-Peer Networks. Proceedings of the 9th International Symposium on Spatial and Temporal Databases, LNCS 2005, 346-363.View ArticleGoogle Scholar
  12. Li Zhenyu, Zhu Zengyang, Xie Gaogang, Li Zhongcheng: Efficient Multi-source Data Dissemination in Peer-to-Peer Networks. IFIP International Federation for Information Processing 2008, LNCS 2008, 409-120.Google Scholar
  13. Oliveira R, Bernardo L: Flooding Techniques for Resource Discovery on High Mobility MANETs. Workshop on WAN 2005.Google Scholar
  14. Lv Q, Cao P, Cohen E, Li K, Shenker S: Search and replication in unstructured peer-to-peer networks. Proceedings of ACM ICS 2002.Google Scholar
  15. Datta A, Quarteroni S, Aberer K: Autonomous Gossiping: A Self-Organizing Epidemic Algorithm for Selective Information Dissemination in Wireless Mobile Ad-Hoc Networks. The International Conference on Semantics of a Networked World 2004.Google Scholar
  16. Jelasity M, Montresor A, Babaoglu O: Gossip-based aggregation in large dynamic networks. ACM Transaction on Computer Systems 2005, 219-252.Google Scholar
  17. Qualnet[http://www.scalable-networks.com/products/qualnet/]

Copyright

© Kim et al; licensee Springer. 2011

This article is published under license to BioMed Central Ltd. This is an Open Access article distributed under the terms of the Creative Commons Attribution License (http://creativecommons.org/licenses/by/2.0), which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.