[논문]PDAODMRP: An Extended PoolODMRP Based on Passive Data Acknowledgement

Cai, Shaobin; Yang, Xiaozong; Wang, Ling

doi:10.1109/jcn.2004.6596837

PDAODMRP: An Extended PoolODMRP Based on Passive Data Acknowledgement 원문보기

Journal of communications and networks, v.6 no.4, 2004년, pp.362 - 375

Cai, Shaobin , Yang, Xiaozong , Wang, Ling

Abstract ▼ AI-Helper

An ad hoc network is a multi-hop wireless network. Its limited bandwidth and frequently changing topology require that its protocol should be robust, simple, and energy conserving. We have proposed PoolODMRP to reduce its control overhead greatly by its one-hop local route maintenance. However, PoolODMRP still has some shortcomings. In this paper, we propose PDAODMRP (passive data acknowledgement ODMRP) to extend PoolODMRP. Compared with PoolODMRP, PDAODMRP has the following contributions: (1) It knows the status of its downstream forwarding nodes by route information collected from data packets instead of BEACON signal of MAC layer; (2) it max simplifies the route information collected from data packets by pool nodes; (3) it adopts a dynamic local route maintenance to enforce its local route maintenance; (4) it adopts the route evaluation policy of NSMP (neighbor supporting multicast protocol). Compared with PoolODMRP, PDAODMRP has lower control overhead, lower data delivery delay, and lower data overhead.

주제어

AI 본문요약
AI-Helper

* AI 자동 식별 결과로 적합하지 않은 문장이 있을 수 있으니, 이용에 유의하시기 바랍니다.

문제 정의

Now, we test the impact of the members of groups on the performance of these protocols to evaluate the scalability of these protocols. In following experiments, the node max speed is 10 m/s; there are 3 groups in the ad hoc network, each of which only has 1 source.

가설 설정

2. The one-link path from the destination to one of its neighbors.
2. The probability that the source reaches one of the neighbors of the destination.
3. The probability (1 - 令广】that the destination is a neighbor of the nodes, which is the first nodes on the link path.

제안 방법

In this subsection, we test the impact of the number of the sources of a multicast group to evaluate the scalability of these protocols. In the following experiments, we set the max speed of nodes as 10 m/s, and set the number of multicast group as 20.

대상 데이터

protocol. In the simulations, 50 wireless mobile nodes, which move around over a square (1000 mx 1000 m), form an ad hoc network. The communication radius of these nodes is 200 m.

성능/효과

From the simulation results, a conclusion can be drawn that PDAODMRP scales best when the members of groups increase because of its most efficient forwarding mesh and its shortest forwarding node lifetime.
From the simulation results, a conclusion can be drawn that the forwardiri흥 mesh maintained by the local route maintenance of PDAODMRP is as robust as that of ODMRP and PatchODMRP. It is stronger than that of NSMP and PoolODMRP, and it is strong enough to stand against fast movement of the mobile nodes.
outperform the tree-based schemes. The study also shows that, among mesh-based schemes, ODMRP outperforms CAMP both in protocol efficient and data delivery ratio. Although ODMRP has some advantages, it still relies on periodically network-wide flooding, which are expensive operations in ad hoc networks [24], to maintain its forwarding mesh.
In these protocols, ODMRP, PatchODMRP, and PDAODMRP have similar forwarding mesh; NSMP and PoolODMRP have weaker forwarding mesh. Therefore, the data delivery ratio of NSMP and PoolODMRP decreases more, and the data delivery delay of NSMP and PoolODMRP increases more, when node speed increases.

참고문헌 (32)

Mobile Ad Hoc Network (MANET) Working Group, available at http://www.ietf.org/html.charters/manet-charter.html.
B. M. Leiner, D. L. Neison, and F. A. Tobagi, 'Issues in packet radio network design,' Proc. IEEE, vol. 75, pp. 6-20, Jan. 1987

상세보기
J. Jubin and J. D. Tornow, 'The DAPAR packet radio network protocols,' Proc. IEEE, vol. 75, pp. 21-32, Jan. 1987

상세보기
S. Paul, Multicasting on the Internet and Its Application, Kluwer Academic Publishers, 1998
T. Clausen et al., 'Optimized link state routing protocol (OLSR),' Internet Draft, IETF, Oct. 2001
C. Perkins and P. Bhagwat, 'Highly dynamic destination-sequenced distance-vector routing (DSDV) for mobile computers,' in Proc. SlGCOMM' 94, vol. 24, Oct. 1994, pp. 234-244
S. Murthy and J. J. Garcia-Luna-Aceves, 'An efficient routing protocol for wireless networks,' ACM/Balzer Mobile Networks and Applications, vol. 1, pp. 183-197, 1996

상세보기
V. Park and S. Corson, 'Temporally ordered routing algorithm (TORA),' Internet Draft, IETF, Aug. 1998
J. Broch, D. B. Johnson, and D. A. Maltz, The Dynamic Source Routing in Ad Hoc Wireless Networks, Kluwer Academic Publishers, 1996
C. Perkins, E. M. Royer, and S. R. Das, 'Ad hoc on-demand distance vector(AODV) routing,' Internet Draft, IETF, June 1999
R. Dube, C. D. Rais, and K. Y. Wang, 'Signal stability-based adaptive routing (SSA) for ad hoc wireless network,' IEEE Pers. Commun., vol. 4, pp. 36-47, 1997

상세보기
J. Broch et al., 'A performance comparison of multihop wireless ad hoc network routing protocols,' in Proc. ACM/IEEE MobiCom '98, Oct. 1998, pp.25-30
P. Johansson et al., 'Scenario based performance analysis of routing protocols for mobile ad hoc networks,' in Proc. IEEE MobiCom '99, pp. 195-206
S. Corson and J. Macker, 'Mobile ad hoc networking (MANET) : Routing protocol performance issues and evaluation considerations,' RFC 2501, IETF, Jan. 1999
C. Chiang, M. Gerla, and L. Zhang, 'Shared tree wireless network multicast,' in Proc. IEEE ICCCN'97, Sept. 1997, pp. 28-33
E. M. Royer and C. E. Perkins, 'Multicast ad hoc ondemand distance vector (MAODV) routing,' Internet Draft, IETF, 2000
E. Bommaiah et al., 'AMRoute : Ad hoc multicast routing protocol,' Internet Draft, IETF, Aug. 1998
C. W.Wu, Y.C. Tay, and C. K. Toh, 'Ad hoc multicast routing protocol utilizing increasing id-numbers (AMRIS) functional specification,' Internet Draft, IETF, Nov. 1998
S. Lee, W. Su, and M. Gerla, 'Ondemand multicast routing protocol(ODMRP) for ad hoc networks,' Internet Draft, IETF, July 2000
S. Lee, W. Su, and M. Gerla, 'On-demand multicast routing protocol,' in Proc. IEEE WCNC99, Sept. 1999, pp. 1298-1302
S. Lee, W. Su, and M. Gerla, 'Ad hoc wireless multicast with mobility prediction,' in Proc.IEEE ICCCN'99, Oct. 1999, pp. 4-9
J. J. Garcia Luna Aceves and E. L. Mdrguga, 'The coreassisted mesh protocol,' IEEE J. Select. Areas Commun., vol.17, pp. 1380-1394, 1999

상세보기
S. Lee et al., 'A performance comparison study of ad hoc wireless multicast protocols,' in Proc. INFOCOM 2000,2000, pp. 751-756
S. Ni et al., 'The broadcast storm problem in a mobile ad hoc network,' in Proc. ACM MobiCom'99, Aug. 1999, pp. 151-162
G. Aggelou and R. Tafazolli, 'RDMAR : A bandwidth-efficient routing protocol for mobile ad hoc networks,' in Proc. ACM IWWMM'99, Aug. 1999, pp. 26-33
S. Lee and C. Kim, 'A new wireless ad hoc multicast routing protocol,' Computer Networks, vol. 38, pp. 121-135, 2002

상세보기
M. Lee and Y. K. Kim, 'PatchODMRP : An ad hoc multicast routing protocol,' in Proc.ICIN 2001, 2001, pp. 537-543
S. Cai and X. Yang, 'The performance of PooIODMRP,' in Proc. IEEE/IFlP MMNS 2003, Sept. 2003, pp. 90-101
S. Cai, X. Yang, and W. Yao, 'The comparison between PoolODMRP and PatchODMRP,' in Proc. IEEE ICON 2003, Sept. 2003, pp. 729-735
IEEE Computer Society LAN MAN Standards Committee, Wireless LAN Medium Access Protocol (MAC) and Physical Layer (PHY) Specification, IEEE Std. 802.11, New York, 1997
S. Cai, L. Wang, and X. Yang. 'An ad hoc multicast protocol based on passive data acknowledgement,' Computer Commun., vol. 27, pp. 1812-1824, 2004

상세보기
Wireless Adaptive Mobility Lab. DEPT of Compo. SCI, UCLA, 'GloMoSim: A scalable simulation environment for wireless and wired network system,' available at http://pcl.cs.ucla.edu/projects/domains/glomos im.html.

원문 URL 링크

DOI : 10.1109/JCN.2004.6596837 [무료]
IEEE : 저널
AccessON : 저널

*원문 PDF 파일 및 링크정보가 존재하지 않을 경우 KISTI DDS 시스템에서 제공하는 원문복사서비스를 사용할 수 있습니다.

오픈액세스(OA) 유형

BRONZE

출판사/학술단체 등이 한시적으로 특별한 프로모션 또는 일정기간 경과 후 접근을 허용하여, 출판사/학술단체 등의 사이트에서 이용 가능한 논문

내보내기 메뉴

내보내기 구분

파일저장
인쇄
메일전송

구성항목

기본정보
상세정보

관리번호, 논문명, 저널/프로시딩명, 저자 , 발행년, 권, 호, 시작페이지, 끝페이지, 발행기관

저장형식

Text(ASCII format)
Excel format
RefWorks Direct Export
RIS format (for Reference Manager, ProCite, EndNote), Scholar's Aids, Mendeley

메일정보

받는사람 (필수): @
보내는사람 (선택): @
제목
내용: KISTI 검색결과 이메일 서비스

안내

총 건의 자료가 검색되었습니다.

다운받으실 자료의 인덱스를 입력하세요. (1-10,000)

검색결과의 순서대로 최대 10,000건 까지 다운로드가 가능합니다.

데이타가 많을 경우 속도가 느려질 수 있습니다.(최대 2~3분 소요)

다운로드 파일은 UTF-8 형태로 저장됩니다.
파일의 내용이 제대로 보이지 않을실 때는 웹브라우저 상단의 보기 -> 인코딩 -> 자동선택 여부를 확인하십시오.

Text(ASCII format)
Excel format

표제어: PCR

동의어: Packet Collision Rate

용어 설명 출처 목록 (6)

용어 설명: PCR은 세균 특이성이 있는 primer를 이용하여 적은 수의 세균이 있을지라도 쉽게 검출할 수 있는 유용한 방법이며, 이를 이용하여 구강 내 치면세균막이나 타액에서 직접 세균을 검출할 수 있게 되었다[8].

AI-Helper ※ AI-Helper는 을 사용합니다.

AI-Helper

안녕하세요, AI-Helper입니다. 좌측 "선택된 텍스트"에서 텍스트를 선택하여 요약, 번역, 용어설명을 실행하세요.
※ AI-Helper는 부적절한 답변을 할 수 있습니다.

연합인증