메뉴 건너뛰기




Volumn , Issue , 2005, Pages 47-54

QoS for data relaying in hierarchical wireless sensor networks

Author keywords

Data relaying; Delay constraints; Sensor networks

Indexed keywords

CONSTRAINT THEORY; DATA REDUCTION; DELAY CONTROL SYSTEMS; ELECTRIC NETWORK TOPOLOGY; PACKET NETWORKS; SENSORS; WIRELESS TELECOMMUNICATION SYSTEMS;

EID: 32144450628     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1089761.1089770     Document Type: Conference Paper
Times cited : (6)

References (23)
  • 2
    • 0035009259 scopus 로고    scopus 로고
    • A clustering scheme for hierarchical control in multi-hop wireless networks
    • S. Banerjee arid S. Khuller. A clustering scheme for hierarchical control in multi-hop wireless networks. In Proc. IEEE INFOCOM, 2001.
    • (2001) Proc. IEEE INFOCOM
    • Banerjee, S.1    Khuller, S.2
  • 5
    • 0004054088 scopus 로고    scopus 로고
    • Wiley-Interscience Series in Discrete Mathematics and Optimization. J. Wiley and Sons Inc., New York
    • W. Cook, W. Cunningham, W. Pulleyblank, and A. Schrijver. Combinatorial optimization. Wiley-Interscience Series in Discrete Mathematics and Optimization. J. Wiley and Sons Inc., New York, 1998.
    • (1998) Combinatorial Optimization
    • Cook, W.1    Cunningham, W.2    Pulleyblank, W.3    Schrijver, A.4
  • 6
    • 0035728721 scopus 로고    scopus 로고
    • Distributed sensor processing over an ad-hoc wireless network: Simulation framework and performance criteria
    • McLean, VA
    • R. V. Dyck and L. Miller. Distributed sensor processing over an ad-hoc wireless network: simulation framework and performance criteria. In Proc. IEEE Milcom, McLean, VA, 2001.
    • (2001) Proc. IEEE Milcom
    • Dyck, R.V.1    Miller, L.2
  • 7
    • 0015330635 scopus 로고
    • Theoretical improvements in algorithmic efficiency for network flow problems
    • J. Edmonds and R. Karp. Theoretical improvements in algorithmic efficiency for network flow problems. J. ACM, 19:248-264, 1972.
    • (1972) J. ACM , vol.19 , pp. 248-264
    • Edmonds, J.1    Karp, R.2
  • 9
    • 0014974581 scopus 로고
    • Duality in nonlinear programming: A simplified applications-oriented development
    • A. Geoffrion. Duality in nonlinear programming: a simplified applications-oriented development. SIAM Review, 13(1):1-37, 1971.
    • (1971) SIAM Review , vol.13 , Issue.1 , pp. 1-37
    • Geoffrion, A.1
  • 10
    • 0042474488 scopus 로고    scopus 로고
    • Mpls over wdm network design with packet level qos constraints based on ilp models
    • L. Gouveia, P. Patricio, A. F. de Sousa, and R. Valadas. Mpls over wdm network design with packet level qos constraints based on ilp models. In Proc. IEEE Infocom, 2003.
    • (2003) Proc. IEEE Infocom
    • Gouveia, L.1    Patricio, P.2    De Sousa, A.F.3    Valadas, R.4
  • 13
    • 0027554501 scopus 로고
    • A faster strongly polynomial minimum cost flow algorithm
    • J. Orlin. A faster strongly polynomial minimum cost flow algorithm. Operations Research, 41(2):338-350, 1993.
    • (1993) Operations Research , vol.41 , Issue.2 , pp. 338-350
    • Orlin, J.1
  • 14
    • 84938862164 scopus 로고    scopus 로고
    • Wireless sensor networks
    • Killarney, Ireland
    • G. Pottie. Wireless sensor networks. In Proc. IEEE Information Theory Workshop, pages 139-140, Killarney, Ireland, 1998.
    • (1998) Proc. IEEE Information Theory Workshop , pp. 139-140
    • Pottie, G.1
  • 15
    • 0003690189 scopus 로고
    • Wiley Interscience series in discrete mathematics. J. Wiley and Sons Inc., New York
    • A. Schrijver. Theory of linear and integer programming. Wiley Interscience series in discrete mathematics. J. Wiley and Sons Inc., New York, 1986.
    • (1986) Theory of Linear and Integer Programming
    • Schrijver, A.1
  • 17
    • 32144461465 scopus 로고    scopus 로고
    • Relay node placement in large scale wireless sensor networks
    • to appear
    • J. Tang, B. Hao, and A. Sen. Relay node placement in large scale wireless sensor networks, to appear in Computer Communications, 2005.
    • (2005) Computer Communications
    • Tang, J.1    Hao, B.2    Sen, A.3
  • 18
    • 51249170715 scopus 로고
    • A strongly polynomial minimum cost circulation algorithm
    • E. Tarclos. A strongly polynomial minimum cost circulation algorithm. Combinatorica, 5:247-255, 1985.
    • (1985) Combinatorica , vol.5 , pp. 247-255
    • Tarclos, E.1
  • 19
    • 0022672734 scopus 로고
    • A strongly polynomial algorithm to solve combinatorial linear programs
    • E. Tardos. A strongly polynomial algorithm to solve combinatorial linear programs. Operations Research, 34(2):250-256, 1986.
    • (1986) Operations Research , vol.34 , Issue.2 , pp. 250-256
    • Tardos, E.1
  • 21
    • 33745062303 scopus 로고    scopus 로고
    • Locally optimal relay node placement in heterogeneous wireless sensor networks
    • to appear
    • Q. Wang, K. Xu, G. Takahara, and H. Hassanein. Locally optimal relay node placement in heterogeneous wireless sensor networks, to appear IEEE Globecom, 2005.
    • (2005) IEEE Globecom
    • Wang, Q.1    Xu, K.2    Takahara, G.3    Hassanein, H.4
  • 22
    • 32144448417 scopus 로고    scopus 로고
    • Optimal design of wireless sensor networks: Minimum cost with lifetime constraints
    • to appear
    • K. Xu, Q. Wang, H. Hassanein, and G. Takahara. Optimal design of wireless sensor networks: minimum cost with lifetime constraints, to appear in Proc. IEEE WiMob, 2005.
    • (2005) Proc. IEEE WiMob
    • Xu, K.1    Wang, Q.2    Hassanein, H.3    Takahara, G.4
  • 23
    • 32144450182 scopus 로고    scopus 로고
    • Distributed clustering for scalable, long-lived sensor networks
    • Purdue University, June
    • O. Younis arid S. Fahmy. Distributed clustering for scalable, long-lived sensor networks. Technical Report TR-03-026, Purdue University, June 2003.
    • (2003) Technical Report , vol.TR-03-026
    • Younis, O.1    Fahmy, A.S.2


* 이 정보는 Elsevier사의 SCOPUS DB에서 KISTI가 분석하여 추출한 것입니다.